« Vrati se
For n an odd positive integer, the unit squares of an n\times n chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an L-shape formed by three connected unit squares. For which values of n is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1858IMO Shortlist 1993 problem C10
1859IMO Shortlist 1993 problem C22
1861IMO Shortlist 1993 problem C40
1873IMO Shortlist 1993 problem N31
2101IMO Shortlist 2002 problem C34
2102IMO Shortlist 2002 problem C41