We prove, within the probabilistic framework of Khinchin families, the Hardy--Ramanujan asymptotic formula for the number $p_k(n)$ of partitions of $n$ into $k$-th powers: \[ p_k(n) \sim \frac{ \alpha_k}{ n^{ (3k+1)/(2k+2)}} \exp\!\bigl(\beta_k\, n^{ 1/(k+1)}\bigr), \quad n \to \infty, \] where $\alpha_k$ and $\beta_k$ are explicit constants depending only on $k$. The argument reduces to verifying strong Gaussianity of the associated Khinchin family and computing \newline asymptotic approximations of its mean and variance.
Categories: math.PR math.CV math.NT