(New page: Category:MA375Spring2009Walther) |
|||
| Line 1: | Line 1: | ||
[[Category:MA375Spring2009Walther]] | [[Category:MA375Spring2009Walther]] | ||
| + | |||
| + | In this problem, I considered the fact that in a convex polygon, diagonals do not connect to three of the other sides. For example in an octagon, at one point there are five connecting diagonals. Therefore the amount of diagonals for the entire octagon would be 8(5), but to account for overcount you have to divide by two. I believe this holds true for all convex polygons, therefore my equation was '''(n(n-3))/2'''. | ||
Latest revision as of 11:59, 28 January 2009
In this problem, I considered the fact that in a convex polygon, diagonals do not connect to three of the other sides. For example in an octagon, at one point there are five connecting diagonals. Therefore the amount of diagonals for the entire octagon would be 8(5), but to account for overcount you have to divide by two. I believe this holds true for all convex polygons, therefore my equation was (n(n-3))/2.
