(i) Definition: a diagonal of an n-gon is a segment joining two vertices that are not the two ends of a side (two non-adjacent vertices). (For a non-convex polygon a diagonal may lie partly outside; it is still a diagonal.)
Counting: label the vertices 1,2,…,n in order. For the 5-gon: from vertex 1 the diagonals go to 3 and 4; from 2 new ones go to 4 and 5; from 3 a new one goes to 5. That is 2+2+1=5. For the 6-gon: 3+3+2+1=9.
| n | 3 | 4 | 5 | 6 | 7 | 8 |
|---|
| Diagonals | 0 | 2 | 5 | 9 | 14 | 20 |
| Increase from previous | — | 2 | 3 | 4 | 5 | 6 |
Pattern and guess: the increases are 2,3,4,…, so we guess 9+5=14 for n=7 and 14+6=20 for n=8.
Check by systematic counting: for n=7, vertex 1 joins 3, 4, 5, 6 (4 diagonals); vertex 2 joins 4, 5, 6, 7 (4); vertex 3 joins 5, 6, 7 (3); vertex 4 joins 6, 7 (2); vertex 5 joins 7 (1). Total 4+4+3+2+1=14. For n=8: 5+5+4+3+2+1=20. Both guesses are correct.
(ii) Formula:
number of diagonals of an n-gon=2n(n−3)
Check: n=5 gives 25×2=5; n=8 gives 28×5=20.
Diagonals added when going from n to n+1 sides: insert a new vertex V between two neighbouring vertices U and W. V is joined by diagonals to every vertex except itself, U and W: that is (n+1)−3=n−2 new diagonals. Also UW, which was a side, now becomes a diagonal: 1 more. So n−1 diagonals are added. (From 4 to 5 sides: 4−1=3 added, matching the table.)
Justification for all n: each of the n vertices is joined by a diagonal to all vertices except itself and its two neighbours, that is, to n−3 vertices. This gives n(n−3), but every diagonal has been counted twice (once from each end). So the number of diagonals is 2n(n−3).
This agrees with the step rule: 2(n+1)(n−2)−2n(n−3)=2n2−n−2−n2+3n=22n−2=n−1.