Glaisher's theorem
On the number of partitions of an integer into parts not divisible by another integer / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Glaisher's theorem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In number theory, Glaisher's theorem is an identity useful to the study of integer partitions. Proved in 1883[1] by James Whitbread Lee Glaisher, it states that the number of partitions of an integer into parts not divisible by is equal to the number of partitions in which no part is repeated or more times. This generalizes a result established in 1748 by Leonhard Euler for the case .