Wolstenholme's theorem, proved by Joseph Wolstenholme in 1862, states that for every prime p of at least 5, the binomial coefficient of 2p minus 1 choose p minus 1 is congruent to 1 modulo p cubed, with an equivalent formulation in terms of congruences among generalized harmonic numbers. Charles Babbage had already proved a weaker version in 1819, showing the same congruence modulo p squared for every prime p of at least 3. The theorem gives rise to the Wolstenholme primes, those satisfying the congruence modulo p to the fourth power, of which only two are currently known, 16843 and 2124679, with none found beyond 10 to the 11th power; whether any composite number satisfies the theorem's congruence at all remains an open question. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Sources
1. Wolstenholme's theorem (Wikipedia)
Lead paragraphQuote, Lead paragraph
The theorem was first proved by Joseph Wolstenholme in 1862
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.