Software Listing of Author : "Kim Walisch"
- primesieve
- License: Shareware
- Price:


primesieve uses the segmented sieve of Eratosthenes with wheel factorization, this algorithm has a complexity of operations and uses space.
Segmentation is currently the best known practical improvement to the sieve of Eratosthenes. Instead of sieving the interval [2, n] at once one subdivides the sieve interval into a number of equal sized segments that are then sieved consecutively. Segmentation drops the memory requirement of the sieve of Eratosthenes from to . The segment size is usually chosen to fit into the CPU's fast L1 or L2 cache memory which significantly speeds up sieving. A segmented version of the sieve of Eratosthenes was first published by Singleton in 1969 [1], Bays and Hudson in [2] describe the algorithm in more detail.
Wheel factorization is used to skip multiples of small primes. If a kth...
- Publisher: Kim Walisch
- Date Released:
- Download Size: 3174 KB
- Download
- Platform: Windows 7, WinOther, WinVista
- primesieve for Windows
- License: Freeware
- Price: 0.00


primesieve is a free software program and C++ library that uses a highly optimized implementation of the sieve of Eratosthenes to generate prime numbers and prime k-tuplets (twin primes, prime triplets, ...) in order up to 2^64 maximum.
- Publisher: Kim Walisch
- Date Released:
- Download Size: 2672 KB
- Download
- Platform: WinOther
- primesieve x64
- License: Shareware
- Price:


primesieve x64 uses the segmented sieve of Eratosthenes with wheel factorization, this algorithm has a complexity of operations and uses space.
Segmentation is currently the best known practical improvement to the sieve of Eratosthenes. Instead of sieving the interval [2, n] at once one subdivides the sieve interval into a number of equal sized segments that are then sieved consecutively. Segmentation drops the memory requirement of the sieve of Eratosthenes from to . The segment size is usually chosen to fit into the CPU's fast L1 or L2 cache memory which significantly speeds up sieving. A segmented version of the sieve of Eratosthenes was first published by Singleton in 1969 [1], Bays and Hudson in [2] describe the algorithm in more detail.
Wheel factorization is used to skip multiples of small primes. If a...
- Publisher: Kim Walisch
- Date Released:
- Download Size: 3788 KB
- Download
- Platform: Win7 x64, WinOther, WinVista x64
