Problem #PRU-5146

Problems Discrete Mathematics Combinatorics

Problem

For a natural number \(n\) consider a regular \(2n\)-gon, with every vertex coloured either blue or green. It is known that the number of blue vertices equals the number of green vertices. Show that the number of main diagonals (passing through the centre of the \(2n\)-gon) with both ends blue is the same as the number of main diagonals with both ends green.