MathGroup Archive 2008

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Prime Number Calculation

  • To: mathgroup at smc.vnet.net
  • Subject: [mg84688] Re: Prime Number Calculation
  • From: Jason Sidabras <jason.sidabras at gmail.com>
  • Date: Thu, 10 Jan 2008 02:23:12 -0500 (EST)
  • References: <200801080630.BAA02151@smc.vnet.net> <fm2221$92b$1@smc.vnet.net>

On Jan 9, 2:53 am, Carl Woll <ca... at wolfram.com> wrote:
> Jason Sidabras wrote:
> >Does anyone have any information about mathematica's prime number
> >algorithm (for Prime[x])?
>
> >Do they use a sieve base algorithm or something more sophisticated?
>
> >Thanks,
>
> >Jason
>
> Check out:
>
> http://reference.wolfram.com/mathematica/note/SomeNotesOnInternalImpl...
>
> Carl Woll
> Wolfram Research

Thank you very much. The sparse caching and sieving algorithm is what
I expected.

I will have to do some research on Lagarias-Miller-Odlyzko algorithm
for PrimePi and figure out how to invert it for prime.

Thank you.

jason


  • Prev by Date: Publicon Word Count
  • Next by Date: Re: Interpolation with vectors
  • Previous by thread: Re: Prime Number Calculation
  • Next by thread: Re: Prime Number Calculation