Originally posted by AbnormalButSane
The Pigeon-Hole Principle
Theorem
Let n and k be positive integers, and let n>k. Suppose we have to place n identical balls into k identical boxes where n>k. Then there will be at least one box in which we place at least two balls.