On the number of summands in a random prime partition

Ralaivaosaona D. (2012)


We study the length (number of summands) in partitions of an integer into primes, both in the restricted (unequal summands) and unrestricted case. It is shown how one can obtain asymptotic expansions for the mean and variance (and potentially higher moments), which is in contrast to the fact that there is no asymptotic formula for the number of such partitions in terms of elementary functions. Building on ideas of Hwang, we also prove a central limit theorem in the restricted case. The technique also generalizes to partitions into powers of primes, or even more generally, the values of a polynomial at the prime numbers. © 2011 Springer-Verlag.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/21405
This item appears in the following collections: