Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

When I enter Prime[2000000000000], the two-trillionth prime, Mathematica gives 61427839512211 for the answer after several minutes of calculation.

I wonder how it calculates to get this number. Apparently, it does not pull that number out from a list, since it spends several minutes to get the answer.

share|improve this question
Related: What is so special about Prime? Another possibly interesting Why does iterating Prime in reverse order require much more time? –  Artes May 24 '13 at 15:51

1 Answer 1

From Some Notes On Internal Implementation:

Prime and PrimePi use sparse caching and sieving. For large $n$, the Lagarias-Miller-Odlyzko algorithm for PrimePi is used, based on asymptotic estimates of the density of primes, and is inverted to give Prime.

share|improve this answer
I believe community wiki abuse is mentioned as a scientific perversion somewhere in the Marquis de Sade complete works. –  belisarius May 24 '13 at 20:21
@bel, I would have left it as a comment, but it was too damn long. :P –  Guess who it is. May 25 '13 at 1:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.