Partition function (number theory)

For a positive integer n, p(n) is the number of distinct ways of representing n as a sum of positive integers. For the purposes of this definition, the order of the terms in the sum is irrelevant: two sums with the same terms in a different order are not considered to be distinct.

By convention p(0) = 1, as there is one way (the empty sum) of representing zero as a sum of positive integers. For the same reason, by definition, p(n) = 0 when n is negative.

The first few values of the partition function, starting with p(0) = 1, are:

1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627, 792, 1002, 1255, 1575, 1958, 2436, 3010, 3718, 4565, 5604, … (sequence A000041 in the OEIS).

Some exact value of p(n) for larger values of n include:[1]

${\displaystyle {\begin{aligned}p(100)&=190,569,292\\p(1000)&=24,061,467,864,032,622,473,692,149,727,991\approx 2.40615\times 10^{31}\\p(10000)&=36,167,251,325,\dots ,906,916,435,144\approx 3.61673\times 10^{106}\\\end{aligned}}}$

As of September 2017, the largest known prime number among the values of p(n) is p(221444161), with 16,569 decimal digits.[2]

The generating function for p(n) is given by[3]

${\displaystyle {\begin{aligned}\sum _{n=0}^{\infty }p(n)x^{n}&=\prod _{k=1}^{\infty }\left({\frac {1}{1-x^{k}}}\right)\\&=(1+x+x^{2}+x^{3}+\cdots )(1+x^{2}+x^{4}+x^{6}+\cdots )(1+x^{3}+x^{6}+x^{9}+\cdots )\cdots \\&={\frac {1}{1-x-x^{2}+x^{5}+x^{7}-x^{12}-x^{15}+x^{22}+x^{26}-\cdots }}\\&=1{\Big /}\sum _{k=-\infty }^{\infty }(-1)^{k}x^{k(3k-1)/2}.\\\end{aligned}}}$

The equality between the products on the first and second lines of this formula is obtained by expanding each factor ${\displaystyle 1/(1-x^{k})}$ into the geometric series ${\displaystyle (1+x^{k}+x^{2k}+x^{3k}+\cdots ).}$ To see that the expanded product equals the sum on the first line, apply the distributive law to the product. This expands the product into a sum of monomials of the form ${\displaystyle x^{a_{1}}x^{2a_{2}}x^{3a_{3}}\cdots }$ for some sequence of coefficients ${\displaystyle a_{i}}$, only finitely many of which can be non-zero. The exponent of the term is ${\displaystyle n=\sum ia_{i}}$, and this sum can be interpreted as a representation of ${\displaystyle n}$ as a partition into ${\displaystyle a_{i}}$ copies of each number ${\displaystyle i}$. Therefore, the number of terms of the product that have exponent ${\displaystyle n}$ is exactly ${\displaystyle p(n)}$, the same as the coefficient of ${\displaystyle x^{n}}$ in the sum on the left. Therefore, the sum equals the product.

The function that appears in the denominator in the third and fourth lines of the formula is the Euler function. The equality between the product on the first line and the formulas in the third and fourth lines is Euler's pentagonal number theorem. The exponents of ${\displaystyle x}$ in these lines are the pentagonal numbers ${\displaystyle P_{k}=k(3k-1)/2}$ for ${\displaystyle k\in \{0,1,-1,2,-2,\dots \}}$ (generalized somewhat from the usual pentagonal numbers, which come from the same formula for the positive values of ${\displaystyle k}$). The pattern of positive and negative signs in the third line comes from the term ${\displaystyle (-1)^{k}}$ in the fourth line: even choices of ${\displaystyle k}$ produce positive terms, and odd choices produce negative terms.

More generally, the generating function for the partitions of ${\displaystyle n}$ into numbers selected from a set ${\displaystyle A}$ of positive integers can be found by taking only those terms in the first product for which ${\displaystyle k\in A}$. This result is due to Leonhard Euler.[4] The formulation of Euler's generating function is a special case of a ${\displaystyle q}$-Pochhammer symbol and is similar to the product formulation of many modular forms, and specifically the Dedekind eta function.

The same sequence of pentagonal numbers appears in a recurrence relation for the partition function:[5]

${\displaystyle {\begin{aligned}p(n)&=\sum _{k\in \mathbb {Z} \setminus \{0\}}(-1)^{k+1}p(n-k(3k-1)/2)\\&=p(n-1)+p(n-2)-p(n-5)-p(n-7)+p(n-12)+p(n-15)-p(n-22)-\cdots \\\end{aligned}}}$

As base cases, ${\displaystyle p(0)}$ is taken to equal ${\displaystyle 1}$, and ${\displaystyle p(k)}$ is taken to be zero for negative ${\displaystyle k}$. Although the sum on the right side appears infinite, it has only finitely many nonzero terms, coming from the nonzero values of ${\displaystyle k}$ in the range

${\displaystyle -{\frac {{\sqrt {24n+1}}-1}{6}}\leq k\leq {\frac {{\sqrt {24n+1}}+1}{6}}}$.

Another recurrence relation for ${\displaystyle p(n)}$ can be given in terms of the sum of divisors function σ:[6]

${\displaystyle p(n)={\frac {1}{n}}\sum _{k=0}^{n-1}\sigma (n-k)p(k).}$

If ${\displaystyle q(n)}$ denotes the number of partitions of ${\displaystyle n}$ with no repeated parts then it follows by splitting each partition into its even parts and odd parts, and dividing the even parts by two, that[7]

${\displaystyle p(n)=\sum _{k=0}^{\left\lfloor n/2\right\rfloor }q(n-2k)p(k).}$

Srinivasa Ramanujan is credited with discovering that the partition function has nontrivial patterns in modular arithmetic. For instance the number of partitions is divisible by five whenever the decimal representation of ${\displaystyle n}$ ends in the digit 4 or 9, as expressed by the congruence[8]

${\displaystyle p(5k+4)\equiv 0{\pmod {5}}}$

For instance, the number of partitions for the integer 4 is 5. For the integer 9, the number of partitions is 30; for 14 there are 135 partitions. This congruence is implied by the more general identity

${\displaystyle \sum _{k=0}^{\infty }p(5k+4)x^{k}=5~{\frac {(x^{5})_{\infty }^{5}}{(x)_{\infty }^{6}}},}$

also by Ramanujan,[9][10] where the notation ${\displaystyle (x)_{\infty }}$ denotes the product defined by

${\displaystyle (x)_{\infty }=\prod _{m=1}^{\infty }(1-x^{m}).}$

A short proof of this result can be obtained from the partition function generating function.

Ramanujan also discovered congruences modulo 7 and 11:[8]

${\displaystyle {\begin{aligned}p(7k+5)&\equiv 0{\pmod {7}},\\p(11k+6)&\equiv 0{\pmod {11}}.\end{aligned}}}$

They come from Ramanujan's identity[10]

${\displaystyle \sum _{k=0}^{\infty }p(7k+5)x^{k}=7~{\frac {(x^{7})_{\infty }^{3}}{(x)_{\infty }^{4}}}+49x~{\frac {(x^{7})_{\infty }^{7}}{(x)_{\infty }^{8}}}.}$

Since 5, 7, and 11 are consecutive primes, one might think that there would be an analogous congruence for the next prime 13, ${\displaystyle p(13k+a)\equiv 0{\pmod {13}}}$ for some a. However, there is no congruence of the form ${\displaystyle p(bk+a)\equiv 0{\pmod {b}}}$ for any prime b other than 5, 7, or 11.[11] Instead, to obtain a congruence, the argument of ${\displaystyle p}$ should take the form ${\displaystyle cbk+a}$ for some ${\displaystyle c>1}$. In the 1960s, A. O. L. Atkin of the University of Illinois at Chicago discovered additional congruences of this form for small prime moduli. For example:

${\displaystyle p(11^{3}\cdot 13\cdot k+237)\equiv 0{\pmod {13}}.}$

Ken Ono (2000) proved that there are such congruences for every prime modulus greater than 3. Later, Ahlgren & Ono (2001) showed there are partition congruences modulo every integer coprime to 6.[12][13]

Approximation formulas exist that are faster to calculate than the exact formula given above.

An asymptotic expression for p(n) is given by

${\displaystyle p(n)\sim {\frac {1}{4n{\sqrt {3}}}}\exp \left({\pi {\sqrt {\frac {2n}{3}}}}\right)}$ as ${\displaystyle n\rightarrow \infty }$.

This asymptotic formula was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. Considering ${\displaystyle p(1000)}$, the asymptotic formula gives about ${\displaystyle 2.4402\times 10^{31}}$, reasonably close to the exact answer given above (1.415% larger than the true value).

Hardy and Ramanujan obtained an asymptotic expansion with this approximation as the first term:[14]

${\displaystyle p(n)\sim {\frac {1}{2\pi {\sqrt {2}}}}\sum _{k=1}^{v}A_{k}(n){\sqrt {k}}\cdot {\frac {d}{dn}}\left({{\frac {1}{\sqrt {n-{\frac {1}{24}}}}}\exp \left[{{\frac {\pi }{k}}{\sqrt {{\frac {2}{3}}\left(n-{\frac {1}{24}}\right)}}}\,\,\,\right]}\right),}$

where

${\displaystyle A_{k}(n)=\sum _{0\leq m<k,\;(m,k)=1}e^{\pi i\left(s(m,k)-2nm/k\right)}.}$

Here, the notation ${\displaystyle (m,k)=1}$ implies that the sum should occur only over the values of ${\displaystyle m}$ that are relatively prime to ${\displaystyle k}$. The function ${\displaystyle s(m,k)}$ is a Dedekind sum.

The error after ${\displaystyle v}$ terms is of the order of the next term, and ${\displaystyle v}$ may be taken to be of the order of ${\displaystyle {\sqrt {n}}}$. As an example, Hardy and Ramanujan showed that ${\displaystyle p(200)}$ is the nearest integer to the sum of the first ${\displaystyle v=5}$ terms of the series.[14]

In 1937, Hans Rademacher was able to improve on Hardy and Ramanujan's results by providing a convergent series expression for ${\displaystyle p(n)}$. It is[15][16]

${\displaystyle p(n)={\frac {1}{\pi {\sqrt {2}}}}\sum _{k=1}^{\infty }A_{k}(n){\sqrt {k}}\cdot {\frac {d}{dn}}\left({{\frac {1}{\sqrt {n-{\frac {1}{24}}}}}\sinh \left[{{\frac {\pi }{k}}{\sqrt {{\frac {2}{3}}\left(n-{\frac {1}{24}}\right)}}}\,\,\,\right]}\right).}$

The proof of Rademacher's formula involves Ford circles, Farey sequences, modular symmetry and the Dedekind eta function.

It may be shown that the ${\displaystyle k}$th term of Rademacher's series is of the order

${\displaystyle \exp \left({\frac {\pi }{k}}{\sqrt {\frac {2n}{3}}}\right),}$

so that the first term gives the Hardy–Ramanujan asymptotic approximation. Paul Erdős (1942) published an elementary proof of the asymptotic formula for ${\displaystyle p(n)}$.[17][18]

Techniques for implementing the Hardy–Ramanujan–Rademacher formula efficiently on a computer are discussed by Johansson (2012), who shows that ${\displaystyle p(n)}$ can be computed in time ${\displaystyle O(n^{1/2+\varepsilon })}$ for any ${\displaystyle \varepsilon >0}$. This is near-optimal in that it matches the number of digits of the result.[19] The largest value of the partition function computed exactly is ${\displaystyle p(10^{20})}$, which has slightly more than 11 billion digits.[20]

• First 4096 values of the partition function