Pigeonhole principle

If $k\in {\mathbb{N}}^{+}$ and $k+1$ or more objects are placed into $k$ boxes, then there is at least one box containing two or more objects.

If there are at least $m$ cocks and $n$ holes such that $m>n$, then there must be at least $1$ hole with more than $1$ cock.