Rademacher's Formula for the Partition Function
Ze-Yong Kong, Lee-Peng Teo

TL;DR
This paper revisits Rademacher's formula for the partition function, providing detailed derivations and asymptotic analysis, along with numerical results to illustrate the convergence and accuracy of the series.
Contribution
It offers a comprehensive pedagogical derivation of Rademacher's formula and derives the leading asymptotic behavior of the partition function p(n).
Findings
Detailed derivation of Rademacher's series for p(n)
Asymptotic formula for p(n) as n approaches infinity
Numerical tables demonstrating convergence and accuracy
Abstract
For a positive integer , let be the number of ways to express as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for in a pedagogical way, with all the details given. We also derive the leading asymptotic behavior of when approaches infinity. Some numerical results are tabled.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories · Analytic Number Theory Research · Advanced Mathematical Identities
