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

Authors

5

  1. LC
    L. Carlitz

    Duke University, United States

    2 publications · 45 citations

    2

    h-index

  2. TA
    Tanbir Ahmed

    Concordia University, Canada

    1 publications · 16 citations

    1

    h-index

  3. SF
    Shishuo Fu

    Chongqing University, China

    1 publications · 17 citations

    1

    h-index

  4. DH
    D. H. Lehmer

    University of California, Berkeley, United States

    1 publications · 31 citations

    1

    h-index

  5. DT
    Dazhao Tang

    Chongqing University, China

    1 publications · 17 citations

    1

    h-index

1–5 of 5

Institutions

4

Venues

  1. arXiv (Cornell University)

    Repository · 1 publications · 17 citations

    1

    h-index

  2. Bulletin of the American Mathematical Society

    1 publications · 31 citations

    1

    h-index

  3. Journal of the London Mathematical Society

    1 publications · 15 citations

    1

    h-index

  4. Integers

    1 publications · 16 citations

    1

    h-index

  5. Canadian Journal of Mathematics

    1 publications · 30 citations

    1

    h-index

1–5