« Vrati se
An n \times n, n \geq 2 chessboard is numbered by the numbers 1, 2, \ldots, n^2 (and every number occurs). Prove that there exist two neighbouring (with common edge) squares such that their numbers differ by at least n.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1977IMO Shortlist 1997 problem 210
1960IMO Shortlist 1997 problem 42
1244IMO Shortlist 1966 problem 610
1181IMO Shortlist 1965 problem 42
1163IMO Shortlist 1962 problem 41
1151IMO Shortlist 1960 problem 51