Message Boards Message Boards

0
|
6807 Views
|
2 Replies
|
1 Total Likes
View groups...
Share
Share this post:

Learn more about the formula for the asymptotic growth of prime numbers?

Posted 5 years ago

In the function gallery, there is a formula for the asymptotic growth of prime numbers. http://functions.wolfram.com/NumberTheoryFunctions/Prime/06/01/0006/

Where can I find more about this? Specifically, how all those terms were found?

POSTED BY: Collin Merenoff
2 Replies

To give a slightly longer answer, this goes back to the Prime Number Theorem, which asserts that the number of prime numbers less than n (implemented in the Wolfram language as PrimePi[n]) is approximated by the function LogIntegral[n], in the sense that

Limit[PrimePi[n]/(LogIntegral[n]), n -> Infinity] == 1

The nth prime number Prime[n] is the inverse function of PrimePi, and so we can describe its asymptotic behavior by inverting the LogIntegral function. This gives the series in question.

For a really good introduction to the Prime Number Theorem, I would recommend H.M. Edwards' book "Riemann's Zeta Function".

http://mathworld.wolfram.com/PrimeFormulas.html / Formula No. 15

An asymptotic formula for $p_n$ is given by (Cipolla 1902). This asymptotic expansion is the inverse of the logarithmic integral $Li(x)$ obtained by series reversion.

POSTED BY: Shenghui Yang
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract