ERDŐS PROBLEM 3 / 21
P(ε)
Erdős–Ginzburg–Ziv Theorem
Additive Combinatorics SOLVED
Every sequence of 2n − 1 integers contains a subsequence of n integers whose sum is divisible by n.
PRIZE None (solved)
Proved in 1961. A foundational result in zero-sum theory, spawning an entire subfield of combinatorial number theory.
Paul Erdős (1913–1996) · >1,500 papers · rotates daily