Source: wikibot/hardy-ramanujan-theorem
= Hardy–Ramanujan theorem
{wiki=Hardy–Ramanujan_theorem}
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.