Affordable Access

Access to the full text

Primality test and primes enumeration using odd numbers indexation

Authors
  • Wolf, Marc
  • Wolf, François
Type
Published Article
Publication Date
May 30, 2021
Submission Date
May 30, 2021
Identifiers
DOI: 10.14738/tmlai.82.8054
Source
arXiv
License
Green
External links

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.

Report this publication

Statistics

Seen <100 times