Integer partition

Layer 0 — Mathematicsin the combinatorics subtree

A way of writing n as a sum n = λ_1 + λ_2 + … + λ_k with λ_1 ≥ … ≥ λ_k ≥ 1. The partition function p(n) grows like (1/4n√3) exp(π√(2n/3)) (Hardy–Ramanujan).

Related concepts

Explore Integer partition on the interactive knowledge graph →