Here is a fact so obvious it feels like cheating — yet it proves deep things. If you have more bananas than baskets, then some basket must hold two. No measuring, no probability, just counting. It’s why two people in London have the exact same number of hairs, and why any list of 13 people has two born in the same month. Slide the bananas past the baskets and watch a collision become unavoidable.
The pigeonhole principle: if n items are placed into m containers and n > m, at least one container holds two or more items. It is a statement of pure counting — no probability — yet it forces existence proofs: among any 13 people two share a birth month; any 5 points in a unit square put two within √2/2; a lossless compressor cannot shrink every input. The generalized form: n items in m boxes force some box to hold at least ⌈n/m⌉. A fail-loud self-check throws unless 13 items in 12 boxes guarantee a shared box. ◆ real combinatorics, node-verified.
The principle is exact and unconditional — it proves a collision EXISTS, not which box; finding the collision can still be hard. That existence-without-location is exactly why it powers so many proofs.