Minkowski's second theorem
An asymptotic expression for p(n) is given by
This asymptotic formula was first obtained by G. H. Hardy and Ramanujan in 1918 and independently by J. V. Uspensky in 1920. Considering p(1000), the asymptotic formula gives about 2.4402 × 1031, 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:
where
Here, the notation (m, n) = 1 implies that the sum should occur only over the values of m that are relatively prime to n. The function s(m, k) is a Dedekind sum.
The error after v terms is of the order of the next term, and v may be taken to be of the order of . As an example, Hardy and Ramanujan showed that p(200) is the nearest integer to the sum of the first v=5 terms of the series.
In 1937, Hans Rademacher was able to improve on Hardy and Ramanujan's results by providing a convergent series expression for p(n). It is
It can be shown that the derivative part of the sum can be simplified.[1] The proof of Rademacher's formula involves Ford circles, Farey sequences, modular symmetry and the Dedekind eta function in a central way.
It may be shown that the k-th term of Rademacher's series is of the order
so that the first term gives the Hardy–Ramanujan asymptotic approximation.