Generating Prime Numbers -- A Fast New Method

2019/04/25 by Kamalappan, V. Vilfred
#11A41 #11A51 #FOS: Mathematics #General Mathematics (math.GM)

paper · doi:10.48550/arxiv.1904.11822

Abstract

Bertrand's Postulate ensures existence of prime p between n and 2n, n an integer ≥ 2 and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in this paper, we provide a simple fast moving algorithm to generate prime numbers up to any given limit. We also discuss Riemann zeta function related to generating of prime numbers.

Related

• Development of sieve of Eratosthenes and sieve of Sundaram's proof
• An algorithm for the prime-counting function of primes larger than three
• The distribution of the non-prime numbers - A new Sieve
• An algorithmic implementation of the Pi function based on a new sieve
• Prime number generation and factor elimination