Euler's Pentagonal Numbers Theorem
Jump to navigation
Jump to search
Theorem
Consider the infinite product:
- $\ds P = \prod_{n \mathop \in \Z_{>0} } \paren {1 - x^n}$
Then $P$ can be expressed as:
- $\ds P = \sum_{n \mathop \in \Z_{>0} } \paren {-1}^{\ceiling {n / 2} } x^{GP_n}$
where:
- $\ceiling {n / 2}$ denotes the ceiling of $n / 2$
- $GP_n$ denotes the $n$th generalized pentagonal number.
That is:
- $P = 1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + \cdots$
Corollary 1
Let $n \in \Z_{>0}$ be a strictly positive integer.
Let $\map {\sigma_1} n$ denote the divisor sum of $n$.
Then:
- $\map {\sigma_1} n = \ds \sum_{1 \mathop \le n - GP_k \mathop < n} -\paren {-1}^{\ceiling {k / 2} } \map {\sigma_1} {n - GP_k} + n \sqbrk {\exists k \in \Z: GP_k = n}$
Corollary 2
Let $n \in \Z_{>0}$ be a strictly positive integer.
Let $\map p n$ denote the number of partitions on $n$.
Then:
- $\map p n = \ds \sum_{1 \mathop \le n - GP_k \mathop < n} -\paren {-1}^{\ceiling {k / 2} } \map p {n - GP_k} + \sqbrk {\exists k \in \Z: GP_k = n}$
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. |
Historical Note
This result was first noticed by Leonhard Paul Euler, who noticed the pattern on starting to multiply out the given infinite product, but he was initially unable to prove it except by a process of informal induction.
Despite this inability, he was so certain of the pattern that he used it as the basis of the development of further theorems.
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $22$
- Feb. 1990: Richard K. Guy: The Second Strong Law of Small Numbers (Mathematics Magazine Vol. 63, no. 1: pp. 3 – 20) www.jstor.org/stable/2691503
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $22$