Mathematics and Applied Mathematics
February 11, 2020
Prime Numbers, Eratosthenes, Factoring Large Numbers, Primality Check
This paper develops an algorithmic version of the Sieve of Eratosthenes to identify all the prime numbers up to and including any desired Natural number. The method also provides for the simple calculation of p(N). In addition, the primary term in the algorithm enables a new and very simple method for the determination of primality or compositeness of any number and, in the case of the latter, the factors involved, which enables these parameters to be easily determined for very large composite numbers. In version 2.0.0 all of the above determinations have been implemented via two Python programs.