The n-th prime asymptotically

Details The n-th prime asymptotically The n-th prime asymptotically

2012-03-24

arxiv.org/abs/1203.5413v2

Mathematics

Number Theory

Scientific paper

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with $\li^{-1}(n)$, after having retained the first m terms, for $1\le m\le 11$, are given. Finally, assuming the Riemann Hypothesis, we give estimations of the best possible $r_3$ such that, for $n\ge r_3$, we have $p_n> s_3(n)$ where $s_3(n)$ is the sum of the first four terms of the asymptotic expansion.

Affiliated with

Also associated with

No associations

Rating

The n-th prime asymptotically does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The n-th prime asymptotically, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The n-th prime asymptotically will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39110