Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (printed p. 45): "Let be distinct non-zero residue classes modulo the prime and let be the number of residue classes of the form
where the are restricted to the values 0 and 1 and are not all 0."
Theorem 1 (printed p. 45). "If , then ."
The introduction places it (p. 45): "P. Erdös and H. Heilbronn [1] showed that if and conjectured that if ." Since , the theorem contains the conjecture, as the abstract says: "we verify a conjecture of P. Erdös and H. Heilbronn: every residue class is represented if ." The paper adds (p. 45): "As shown in [1], this is nearly best possible: If , and , then (for ) the residue cannot be expressed in the form (1)."
In the problem's notation. The class is among the classes exactly when some nonempty subfamily of sums to . So Theorem 1 says: every set of distinct nonzero residues modulo a prime with has a nonempty with ; a set containing the residue has the subset . This is the site's question for prime with any constant , since . The near-sharpness example concerns the full representation property , not the zero-sum question alone, whose prime threshold is by Balandraud's Theorem 9.
Source. J. E. Olson, An Addition Theorem Modulo p, J. Combinatorial Theory 5 (1968), no. 1, 45--52, DOI 10.1016/S0021-9800(68)80027-4; Theorem 1 and the surrounding introduction on printed p. 45 (PDF p. 1 of the publisher's open-archive scan), its proof on printed pp. 46--47 (PDF pp. 2--3), read on the page images (the OCR text layer garbles the displays). The edition is identified in the source digest.
Read depth. Claims checked: the statement, the definition of and display (1), the recalled theorem and conjecture of Erdős and Heilbronn, the near-best-possible example and the statement of Theorem 2 with its displays (2)--(4) were read clause by clause on the page images of PDF pp. 1--2 on 2026-09-22. The proof of Theorem 1 (pp. 46--47) was read in full on the page images and its reduction to Theorem 2 was followed; the proof of Theorem 2 (pp. 47--52) was read in the text layer for structure only and not checked. Nothing here is independently reviewed.
Proof pointer
Pages 46--47, from Theorem 2 (pp. 45--46): for nonzero classes with for , the number of classes of the form , , including , satisfies for even and for odd (display (4)). The paper writes out the case ("the proofs for the other three cases, where we obtain slightly smaller lower estimates for , are similar"). Put and , and order the so that no two of and no two of are negatives of each other. With and , Theorem 2 gives ( is odd, and from ) and ( is even). Let be with zero removed; then , so is the whole group (p. 47), and every element of is a sum of the form (1) with some , so . The proof of Theorem 2 (pp. 47--52) is an elementary induction on through the difference-counting function (Lemma 2.1), a sumset lower bound for symmetric sets not in arithmetic progression derived from Vosper's theorem (Lemma 2.2), and a lower bound for (Lemma 2.3). Not reconstructed here.
Dependencies
Within the paper: Theorem 2 (pp. 45--46), through Lemmas 2.1--2.3 (pp. 47--49). Outside it: Vosper's theorem on sumsets in , cited to Mann, Addition Theorems (Wiley, 1965), Theorem 1.3, p. 3, not held; and the ideas of Erdős and Heilbronn 1964 (erdos_1964_addition_residue_classes_mod), whose Theorem I is the bound the paper improves.
Bears on
- Problem 540: the prime case of the question, with the constant of Erdős and Heilbronn's Conjecture 3 and the slightly better threshold ; the site's "proved for prime by Olson [Ol68]". Composite and general finite abelian groups are Szemerédi's Theorem; the constant for primes is Balandraud's Theorem 9.