I've looked at these links already;

What are the limits of the Prime-functions?

What is so special about Prime?

which gave an answer for earlier versions of Mathematica. Yet when I try to input either OmegaPrime or OmegaPrimePi, and then hit enter, I don't get any numbers. I have tried using N[OmegaPrime] to force a number. It's as if the functions have been removed in version 9.0 . And someone mentioned using PrimeOmega, so I tried that and N[PrimeOmega]. I would also like to know if version 10.0 has a higher Prime[n] so I can decide on whether to upgrade.

  • 4
    $\begingroup$ OmegaPrime never existed in any version of Mathematica; you misunderstood Artes's statement. This number was found by him using a divide-and-conquer method. It is not a value tabulated in Mathematica itself but depends on the implementation of Prime. $\endgroup$ Sep 14, 2015 at 16:08
  • $\begingroup$ @ Oleksandr R. - I would accept your comment as an answer, if you re-post comment as an answer, I can award you reputation points. $\endgroup$
    – user24719
    Sep 17, 2015 at 21:29
  • $\begingroup$ Thanks, but since the question has been marked as a duplicate, it is not possible to add an answer any more. It doesn't matter about the points. Actually, I was unsure about whether your question concerned OmegaPrime specifically, or the limits of Prime more generally. I don't know if the latter have been changed for Mathematica 10 (although I suspect not, given Daniel Lichtblau's remarks), but if the limitations are your main concern, the other thread seems to cover this topic well enough and your question can legitimately be considered a duplicate. $\endgroup$ Sep 17, 2015 at 22:12
  • $\begingroup$ @ mathematica.stackexchange.com/users/312/oleksandr-r $\endgroup$
    – user24719
    Sep 22, 2015 at 15:32
  • $\begingroup$ @ Oleksandr R. -That sucks. I don't consider this question to be duplicate since I edited the question so that it would not be duplicate anymore and cater to the answer (which is a backwards way I have of doing things). It was marked as duplicate before I edited it. An answer is a curiosity but no longer needed, as I've since explored the constraints of Mathematica and have mathematically determined on paper that the initial max "seed prime" for the code/formula I developed is well under the max Prime[n] and also at a size that can be determined in 0.000? time. Good news, I will explain... $\endgroup$
    – user24719
    Sep 22, 2015 at 15:52