Re: [OctDev] list of primes using D. Bersteins fast primegen library

[Paul Kienzle]

On Jun 10, 2006, at 10:57 PM, Dr.-Ing. Torsten Finke wrote:

> Dear Octave Developers
>
> attached you will find a tarball containing a few little functions to
> - calculate list of primes in given ranges
> - calculate number of primes up to given bound
>
> those functions are based on D. Bernsteins primegen library, that 
> provides
> very fast O(N) functions. These functions calculate the list of primes 
> up to 10,000,000
> 15 times faster than the well known octave-forge function primes(). The
> advantage grows with increasing bounds.

Given that primes is a core function, I think John will want it
included in octave.

- Paul

primegen-octave.tgz
Description: GNU Zip compressed data