Re: Nth Index of a Prime
- --- In firstname.lastname@example.org,
"Jens Kruse Andersen" <jens.k.a@...> wrote:
> Two years ago I searched for a good pi(x) program,Thanks, Jens!
> found an old mention of Christian Bau and dug up a link to
> http://www.cbau.freeserve.co.uk [broken URL]
seems to be an appropriate archived URL. "PrimeCount.cp" says:
> This code is unfinished work in progress. For this reason,which seems to permit personal use.
> you may download this code and use it on the computer that
> you used for downloading, but any further distribution is
> strictly prohibited.
- Looks like Bau's code goes twice as high as Baugh's code and I don't have source code. The code the community needs is that developed by Tomás Oliveira e Silva. His can go to at least 10^23. I have asked, but I guess not nicely enough.
--- In email@example.com, "djbroadhurst" <d.broadhurst@...> wrote:
> --- In firstname.lastname@example.org,
> David Baugh <PbtoAu@> wrote:
> > pi(1357911131197531) = 40159216312772
> > The next one is too big for my implementation
> How did you compute pi(x) with x > 10^15, please, David?
> Andrew Booker's programme hosted at
> is restricted to pi(x) with x < 3*10^13.
> For those with dollars to burn, Mma seems
> able to compute pi(x) with x < 8*10^13:
> It seems that you have an implementation that
> comfortably copes with x > 10^15.
> Might you consider making your code available to
> Chris Caldwell, for on-line use at the Prime Pages,
> as Andrew generously did with his? If the data tables
> are too big or the CPUtime too onerous for such on-line use,
> might you kindly provide a source that others may compile?
> Best regards
> David Broadhurst