Timeline for Number of long and short diagonals for an n-sided regular polygon
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2021 at 14:01 | answer | added | David K | timeline score: 1 | |
| Feb 1, 2021 at 5:01 | comment | added | David K | If you are interested in the question, "if a diagonal is chosen at random, what is the probability that it is neither a shortest, nor a longest diagonal", you could edit it into the text of your main question. But I agree, a "longest diagonal" would have the maximum possible vertices between endpoints. Next you must determine how many diagonals there are which are neither shortest nor longest. | |
| Feb 1, 2021 at 4:48 | comment | added | Saumya Chaturvedi | But then we'd have chosen all the diagonals to exist, whereas the question asked "if a diagonal is chosen at random, what is the probability that it is neither a shortest, nor a longest diagonal". But I get your point, for the longest diagonal we must choose some other one with maximum possible vertices between endpoints. | |
| Jan 31, 2021 at 21:03 | comment | added | David K | It sounds like the teacher thought you meant a diagonal with exactly two vertices between endpoints when you defined a "long diagonal", because indeed there are exactly $15$ of those diagonals in a regular $15$-gon. There are another $15$ diagonals with exactly three vertices between the endpoints, and others with more vertices between endpoints. | |
| Jan 31, 2021 at 20:53 | history | edited | KReiser |
edited tags
|
|
| Jan 31, 2021 at 20:50 | review | First posts | |||
| Jan 31, 2021 at 20:58 | |||||
| Jan 31, 2021 at 20:49 | history | asked | Saumya Chaturvedi | CC BY-SA 4.0 |