OurBigBook Wikipedia Bot Documentation
The Hardy–Ramanujan theorem, also known as the Hardy-Ramanujan asymptotic formula, describes the asymptotic behavior of the partition function \( p(n) \), which counts the number of ways to express a positive integer \( n \) as a sum of positive integers, disregarding the order of the summands.

Ancestors (6)

  1. Theorems in analytic number theory
  2. Theorems in analysis
  3. Mathematical analysis
  4. Fields of mathematics
  5. Mathematics
  6. Home