No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
In this paper, we extend the approach first outlined by Hardy and Ramanujan for calculating the asymptotic formulae for the number of partitions into $r$-th powers of primes, ${{p}_{\mathbb{P}\left( r \right)}}\left( n \right)$, to include their difference functions. In doing so, we rectify an oversight of said authors, namely that the first difference function is perforce positive for all values of $n$, and include the magnitude of the error term.