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

[David Bateman]

Paul Kienzle wrote:

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

Given that the current core function is an m-file and the new code is an
oct-file with a dependency on a C file, this needs some thought.

D.

-- 
David Bateman                                address@hidden
Motorola Labs - Paris                        +33 1 69 35 48 04 (Ph) 
Parc Les Algorithmes, Commune de St Aubin    +33 6 72 01 06 33 (Mob) 
91193 Gif-Sur-Yvette FRANCE                  +33 1 69 35 77 01 (Fax) 

The information contained in this communication has been classified as: 

[x] General Business Information 
[ ] Motorola Internal Use Only 
[ ] Motorola Confidential Proprietary