Birthday problem
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
Twenty-three people
A room needs 253 people before someone probably shares a birthday with you. It needs 23 before two of them probably share one with each other. The gap between those numbers is the whole problem.
Any unevenness brings the match sooner
Real birthdays are not spread evenly across the year, and every such departure pushes the famous twenty-three down rather than up. The proof is one move on two days at a time, and what it leaves behind is a single number — the one ecologists use to count species.
A collision that finds a factor
A walk through the remainders modulo a number must eventually repeat, and it repeats modulo each hidden prime factor long before it repeats modulo the number. Pollard saw that the earlier repeat can be detected without knowing the prime — and that its timing is the birthday problem, so the cost is the square root of the factor.
Named alongside it
The objects these essays reach for when they reach for this one.
CollisionComplementary countingIndependenceChinese remainder theoremConvexityFactoringGreatest common divisorHash collisionIterationModular arithmeticPairsPigeonhole principle