Glaisher's Theorem
Glaisher's Theorem is a fundamental result in the theory of integer partitions that states the number of partitions of a positive integer \( n \) into parts not divisible by a fixed integer \( d \) is equal to the number of partitions of \( n \) in which no part appears more than \( d-1 \) times.
5
Publications
109
Citations
5
Authors
4
Institutions
Publications per year
2017–2026
1
Parents
5
L. Carlitz · Canadian Journal of Mathematics · 1953 · 30 citations · Full text
Generalizing a partition theorem of Andrews
Shishuo Fu, Dazhao Tang · arXiv (Cornell University) · 2017 · 17 citations · Full text
Some new van der Waerden numbers and some van der Waerden-type numbers
Tanbir Ahmed · Integers · 2009 · 16 citations
L. Carlitz · Journal of the London Mathematical Society · 1953 · 15 citations
1–5 of 5
5
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 5
4
Duke University
Durham, United States
2 h-index
2 publications
45 citations
Concordia University
Portland, United States
1 h-index
1 publications
16 citations

Concordia University
Montreal, Canada
1 h-index
1 publications
16 citations
Duke Energy (United States)
Charlotte, United States
1 h-index
1 publications
15 citations
1–4 of 4
Repository · 1 publications · 17 citations
1
h-index
1 publications · 31 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 30 citations
1
h-index
1–5