Calculate number of pairs of parallel diagonals in a 20 sided regular polygon . If this value is x then x = ? If your answer is 640 then answer as 480, if your answer is 600 answer as 0 and if your answer is 400 then answer as 10
Additional Challenge : Derive a formula to find pairs of parallel diagonals in n sided regular polygon and post it in explanation.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let us number the vertices of polygon as shown in figure below and denote the sides and diagonals of polygon by the vertices it contains. For example, the diagonal formed by joining the vertices 1 and 3 will be denoted by ( 1 , 3 ) and so on. Let us try to make groups of parallel diagonals. Let us start with diagonal ( 1 , 3 ) . Since the polygon is regular, by symmetry it is easy to deduce that ( n , 4 ) and ( n − 1 , 5 ) will be parallel to ( 1 , 3 ) . We see that on decreasing one vertex and increasing the other by 1 we get a new parallel diagonal. ( 1 is decreased by 1 to get n ) Given any diagonal ( p , q ) , ( p ± k , q ∓ k ) is parallel to ( p , q ) for all k such that ( p ± k , q ∓ k ) is valid diagonal. Making a group of diagonals ( 1 , 3 ) , ( n , 4 ) and ( n − 1 , 5 ) we see that sum of the vertex in each diagonal is either 4 or n + 4 . This is the defining property of diagonals of this group.
Similarly making the group of ( 1 , 4 ) , ( n , 5 ) and ( n − 1 , 6 ) we see that sum of the vertex in each diagonal is either 5 or n + 5 and so on there will be a group whose vertex sum is 6 or n + 6 . In general there will be a separate group for separate vertex sum. Denoting G m as the group of diagonals with vertex sum m or n + m , where m ranges from 4 to n + 3 , m = n + 4 and onwards will come in G 4 and onward. So there will be total of n groups from G 4 to G n + 3 . Also denoting by N ( m ) , the number of diagonals in group G m .
Case 1 : n is odd Group G m , 4 ≤ m ≤ n
Sum of the vertex will be m or n + m This group contains the diagonals : ( 1 , m − 1 ) ( n , m ) ( 2 , m − 2 ) ( n − 1 , m + 1 ) ⋮ ⋮ ( l , m − l ) ( n − k , m + k ) Diagonals ( l , m − l ) and ( n − k , m + k ) are such that the difference between the vertex in these diagonals is minimum. This minimum difference for the diagonal is 2 or 3 depending upon parity of m .
l = 2 m − 2 when m is even and k = 2 n − m − 3 when m is even l = 2 m − 3 when m is odd and k = 2 n − m − 2 when m is odd Counting all the diagonals we get N ( m ) = l + k + 1 = 2 n − 3 ( independent of m )
Group G n + 1
Sum of the vertex will be n + 1 This group contains the diagonals : ( 2 , n − 1 ) ( 3 , n − 2 ) ⋮ ( l , n − l + 1 ) Again, diagonal ( l , n − l + 1 ) is such that the difference between the vertex of this diagonal is 2 which gives l = 2 n − 1 Counting all the diagonals we get N ( n + 1 ) = l − 1 = 2 n − 3
Group G n + 2
Sum of the vertex will be n + 2 This group contains the diagonals : ( 2 , n ) ( 3 , n − 1 ) ⋮ ( l , n − l + 2 ) Again, diagonal ( l , n − l + 2 ) is such that the difference between the vertex of this diagonal is 3 which gives l = 2 n − 1 Counting all the diagonals we get N ( n + 2 ) = l − 1 = 2 n − 3
Group G n + 3
Sum of the vertex will be n + 3 This group contains the diagonals : ( 3 , n ) ( 4 , n − 1 ) ⋮ ( l , n − l + 3 ) Again, diagonal ( l , n − l + 3 ) is such that the difference between the vertex of this diagonal is 2 which gives l = 2 n + 1 Counting all the diagonals we get N ( n + 3 ) = l − 2 = 2 n − 3
Total number of diagonals in all the n groups = ∑ m = 4 n N ( m ) + N ( n + 1 ) + N ( n + 2 ) + N ( n + 3 ) = ( n − 3 ) 2 ( n − 3 ) + 3 ( 2 n − 3 ) = 2 n ( n − 3 ) = total number of diagonals in n -sided polygon. This confirms that no diagonal has been missed and no diagonal has been counted twice.
Let P ( n ) denote the number of pair of parallel diagonals in n -sided regular polygon. Then
P ( n ) = ∑ m = 4 n + 3 N ( m ) C 2 = n 2 n − 3 C 2 = n 2 ( 2 n − 3 ) ( 2 n − 3 − 1 ) = 8 n ( n − 3 ) ( n − 5 )
Case 2 : n is even Group G m , 4 ≤ m ≤ n
Sum of the vertex will be m or n + m This group contains the diagonals : ( 1 , m − 1 ) ( n , m ) ( 2 , m − 2 ) ( n − 1 , m + 1 ) ⋮ ⋮ ( l , m − l ) ( n − k , m + k ) Again, difference between the vertex in diagonals ( l , m − l ) and ( n − k , m + k ) is minimum i.e. either 2 or 3 which gives us
l = 2 m − 2 when m is even and k = 2 n − m − 2 when m is even l = 2 m − 3 when m is odd and k = 2 n − m − 3 when m is odd Counting all the diagonals we get N ( m ) = l + k + 1 = { 2 n − 4 2 n − 2 m is odd m is even
Group G n + 1
Sum of the vertex will be n + 1 This group contains the diagonals : ( 2 , n − 1 ) ( 3 , n − 2 ) ⋮ ( l , n − l + 1 ) Again, diagonal ( l , n − l + 1 ) is such that the difference between the vertex of this diagonal is 3 which gives l = 2 n − 2 Counting all the diagonals we get N ( n + 1 ) = l − 1 = 2 n − 4
Group G n + 2
Sum of the vertex will be n + 2 This group contains the diagonals : ( 2 , n ) ( 3 , n − 1 ) ⋮ ( l , n − l + 2 ) Again, diagonal ( l , n − l + 2 ) is such that the difference between the vertex of this diagonal is 2 which gives l = 2 n Counting all the diagonals we get N ( n + 2 ) = l − 1 = 2 n − 2
Group G n + 3
Sum of the vertex will be n + 3 This group contains the diagonals : ( 3 , n ) ( 4 , n − 1 ) ⋮ ( l , n − l + 3 ) Again, diagonal ( l , n − l + 3 ) is such that the difference between the vertex of this diagonal is 3 which gives l = 2 n Counting all the diagonals we get N ( n + 3 ) = l − 2 = 2 n − 4
In general, it can be said that for any m ∈ { 4 , 5 , 6 , ⋯ n + 2 , n + 3 }
N ( m ) = { 2 n − 4 2 n − 2 m is odd m is even
Then number of pair of parallel diagonals, P ( n ) = ∑ m = 4 n + 3 N ( m ) C 2 = 2 n 2 n − 4 C 2 + 2 n 2 n − 2 C 2 = 2 n 2 ( 2 n − 4 ) ( 2 n − 4 − 1 ) + 2 n 2 ( 2 n − 2 ) ( 2 n − 2 − 1 )
⇒ P ( n ) = 8 n ( n − 4 ) { 2 n − 6 + 2 n − 2 }
⇒ P ( n ) = 8 n ( n − 4 ) 2
Hence number of pair of parallel diagonals in n -sided regular polygon is given by
P ( n ) = ⎩ ⎨ ⎧ 8 n ( n − 3 ) ( n − 5 ) 8 n ( n − 4 ) 2 n is odd n is even
Putting n = 2 0 we get P ( n ) = 6 4 0