Description
Primesieve is an educational app dedicated to math scientists and students.
Primesieve comes accompanied by a C++ library that uses a highly optimized implementation of the sieve of Eratosthenes. The main aim of the assembly is to generate prime numbers and prime k-tuplets (twin primes, prime triplets, etc.).
Primesieve uses the segmented sieve of Eratosthenes with wheel factorization also known as Pritchard's segmented wheel sieve. The algorithm has a complexity of O(n) operations and is using O(sqrt(n)) bits of memory.
In 2002 Tomas Oliveira e Silva made an improvement to the segmented sieve of Eratosthenes using linked lists allowing use of segments smaller than sqrt(n) without deteriorating efficiency.
This is important as only small segments that fit into the CPU's L1 or L2 cache provide fast memory access.
Although a few other prime number sieves are known now that are slightly more efficient and use O(n/log log n) operations the segmented wheel sieve (with linked lists) has been the fastest prime number sieve since its discovery in 1981.
Primesieve is cross-platform and it works on Mac OS X, Windows and Linux. Binaries for the Windows and Linux platforms are available on the project's homepage.
User Reviews for Primesieve FOR MAC 1
-
for Primesieve FOR MAC
Primesieve FOR MAC provides a powerful tool for math scientists and students. Its segmented sieve ensures efficient prime number generation.