Approximate Formula for Number of Partitions

Theorem

The number of partitions $\map p n$ of a (strictly) positive integer $n$ is given by the approximation:

$\map p n \approx \dfrac {e^{\pi \sqrt {2 n / 3} } } {4 n \sqrt 3}$

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1992: George F. Simmons: Calculus Gems ... (previous) ... (next): Chapter $\text {A}.21$: Euler ($\text {1707}$ – $\text {1783}$): Footnote $7$