http://dx.doi.org/10.4153/CJM-2009-024-6
Canad. J. Math. 61(2009), 465-480
Published:2009-04-01 Printed: Apr 2009
Features coming soon:
Citations (via CrossRef)
Tools:
Search Google Scholar:
Abstract
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}^{(r)}}(n)$,
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.
© Canadian Mathematical Society, 2013
|