Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

On the number of summands in a random prime partition

Abstract

Paper presented at Strathmore International Math Research Conference on July 23 - 27, 2012We 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.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

Similar works

This paper was published in SU+ Digital Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.