A fundamental problem studies the number of ways
can be written as a sum
of positive integers
, that is, the number of solutions of
The number of summands is unrestricted, repetition is allowed, and the order of
the summands is not taken into account. The corresponding unrestricted
partition function is denoted by
, and the summands are
called parts; see §26.9(i). For example,
because there are exactly seven partitions of 5:
.
The number of partitions of
into at most
parts is denoted by
; again see §26.9(i).
Euler introduced the reciprocal of the infinite product

as a generating function for the function
defined in
§27.14(i):
with
. Euler’s pentagonal number theorem states
that
where the exponents 1, 2, 5, 7, 12, 15,
are the
pentagonal numbers, defined by
Multiplying the power series for
with that for
and equating coefficients, we obtain the recursion formula
where
is defined to be 0 if
. Logarithmic
differentiation of the generating function
leads to another
recursion:
where
is defined by (27.2.10) with
.
These recursions can be used to calculate
, which grows
very rapidly. For example,
= 1905 69292, and
. For large
where
(Hardy and Ramanujan (1918)).
Rademacher (1938) derives a convergent series that also provides an
asymptotic expansion for
:
where
and
is a Dedekind sum given by
Ramanujan (1921) gives identities that imply divisibility properties of the partition function. For example, the Ramanujan identity
implies
. Ramanujan also found that
and
for all
. After decades of nearly
fruitless searching for further congruences of this type, it was believed that
no others existed, until it was shown in Ono (2000) that there are
infinitely many.
Ono proved that for every prime
there are integers
and
such that
for all
. For example,
.
The discriminant function
is defined by
and satisfies the functional equation
if
are integers with
and
.
The 24th power of
in (27.14.12) with
is an infinite product that generates a power series in
with integer coefficients called Ramanujan’s tau function
:

The tau function is multiplicative and satisfies the more general relation:

Lehmer (1947) conjectures that
is never 0 and
verifies this for all
by studying various congruences
satisfied by
, for example: