A partition of n is a way to write n as a sum of positive integers (order doesn't matter). The partition function p(n) grows astonishingly fast — and Ramanujan found an asymptotic formula.
Select a partition below
p(12) = ? partitions
p(n) growth with Ramanujan asymptotic: p(n) ~ exp(π√(2n/3)) / (4n√3)