arXiv · 2106.01327
Primality test and primes enumeration using odd numbers indexation
Abstract
Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves computational time by a constant. We then apply similar techniques to Atkin prime-numbers sieve which uses modulus operations and finally to Pritchard wheel sieve, in both case yielding similar results.
Explore related subjects
Keep this discovery
Marc Wolf, François Wolf. 2021-05-30. Primality test and primes enumeration using odd numbers indexation. https://doi.org/10.14738/tmlai.82.8054
Cite the original work for its findings. Save a collection to share your selection of sources.