Rademacher’s series for the partition function

  • Tom M. Apostol
Part of the Graduate Texts in Mathematics book series (GTM, volume 41)


The unrestricted partition function p(n) counts the number of ways a positive integer n can be expressed as a sum of positive integers ≆n. The number of summands is unrestricted, repetition is allowed, and the order of the summands is not taken into account.


Partition Function Lattice Point Consecutive Pair Farey Fraction Additive Number Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Tom M. Apostol
    • 1
  1. 1.California Institute of TechnologyPasadenaUSA

Personalised recommendations