Glaisher's theorem
Glaisher's theorem is an On the number of partitions of an integer into parts not divisible by another integer.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2461730271
- Described as
- On the number of partitions of an integer into parts not divisible by another integer
- What it is
- theorem
- Wikipedias with a page
- 5
Wikidata item Q5566491 (wikidata.org/wiki/Q5566491), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1381855592
In number theory, Glaisher's theorem is an identity useful to the study of integer partitions. Proved in 1883 by James Whitbread Lee Glaisher, it states that the number of partitions of an integer n into parts not divisible by d is equal to the number of partitions in which no part is repeated d or more times. This generalizes a result established in 1748 by Leonhard Euler for the case d=2.
From the Wikipedia article “Glaisher's theorem” (en.wikipedia.org/wiki/Glaisher's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
