« Vrati se
A square (n - 1) \times (n - 1) is divided into (n - 1)^2 unit squares in the usual manner. Each of the n^2 vertices of these squares is to be coloured red or blue. Find the number of different colourings such that each unit square has exactly two red vertices. (Two colouring schemse are regarded as different if at least one vertex is coloured differently in the two schemes.)

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2298IMO Shortlist 2009 problem C29
1938IMO Shortlist 1996 problem C31
1873IMO Shortlist 1993 problem N31
1861IMO Shortlist 1993 problem C40
1859IMO Shortlist 1993 problem C22
1858IMO Shortlist 1993 problem C10