MathGroup Archive 2008

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

Search the Archive

Re: Prime Number Calculation

  • To: mathgroup at smc.vnet.net
  • Subject: [mg84669] Re: Prime Number Calculation
  • From: Jens-Peer Kuska <kuska at informatik.uni-leipzig.de>
  • Date: Tue, 8 Jan 2008 06:45:19 -0500 (EST)
  • Organization: Uni Leipzig
  • References: <flv5ie$27s$1@smc.vnet.net>
  • Reply-to: kuska at informatik.uni-leipzig.de

Hi,

the online implementation notes say

"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."

Regards
   Jens

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
> 


  • Prev by Date: Interpolation with vectors
  • Next by Date: Re: Using MathLink with Visual Express
  • Previous by thread: Re: Prime Number Calculation
  • Next by thread: Using MathLink with Visual Express