[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [OctDev] list of primes using D. Bersteins fast primegen library
From: |
Paul Kienzle |
Subject: |
Re: [OctDev] list of primes using D. Bersteins fast primegen library |
Date: |
Sun, 11 Jun 2006 20:10:03 -0400 |
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
- Re: [OctDev] list of primes using D. Bersteins fast primegen library,
Paul Kienzle <=
- Re: [OctDev] list of primes using D. Bersteins fast primegen library, David Bateman, 2006/06/12
- Message not available
- Message not available
- Message not available
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, David Bateman, 2006/06/14
- Message not available
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, David Bateman, 2006/06/14
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, John W. Eaton, 2006/06/14
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, David Bateman, 2006/06/14
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, John W. Eaton, 2006/06/14
- Re: [OctDev] list of primes using D. Bernsteins fast primegen library, David Bateman, 2006/06/14