This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2010 N.N. Mihăileanu Individual, 4
A square grid is composed of $ n^2\equiv 1\pmod 4 $ unit cells that contained each a locust that jumped the same amount of cells in the direccion of columns or lines, without leaving the grid. Prove that, as a result of this, at least two locusts landed on the same cell. [i]Marius Cavachi[/i]
discrete mathematics modular arithmetic locusts pigeonhole principle combinatorics square grid number theory