We first derive a function that eliminates any sequence of equidistant numbers from the integer numbers, and its inverse. We use the sequence elimination function to eliminate the multiples of the prime numbers from integer numbers to produce formulas that generate all prime numbers in a certain interval.

sequence elimination function, prime numbers.

Received: December 25, 2020; Accepted: January 22, 2021; Published: February 22, 2021

How to cite this article: Ahmed Diab, Sequence elimination function and the formulas of prime numbers, Far East Journal of Mathematical Education 21(1) (2021), 7-21. DOI: 10.17654/ME021010007

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] Leonard M. Adleman, On distinguishing prime numbers from composite numbers, 21st Annual Symposium on Foundations of Computer Science (SFCS 1980), IEEE, 1980, pp. 387-406.
[2] Richard Crandall and Carl B. Pomerance, Prime Numbers: A Computational Perspective, Springer Science + Business Media, Volume 182, 2006.
[3] Donald B. Gillies, Three new Mersenne primes and a statistical theory, Math. Comp. 18(85) (1964), 93-97.
[4] Richard Guy, Unsolved Problems in Number Theory, Springer Science + Business Media, Volume 1, 2004.
[5] Godfrey Harold Hardy and Edward Maitland Wright, An Introduction to the Theory of Numbers, Oxford University Press, 1979.
[6] Albert Edward Ingham and Albert Edward Ingham, The Distribution of Prime Numbers, Cambridge University Press, Number 30, 1990.
[7] Michal Krizek, Florian Luca and Lawrence Somer, 17 Lectures on Fermat Numbers: From Number Theory to Geometry, Springer Science + Business Media, 2002.
[8] Paulo Ribenboim, Euler’s famous prime generating polynomial and the class number of imaginary quadratic fields, My Numbers, My Friends: Popular Lectures on Number Theory, 2000, pp. 91-111.
[9] Eric W. Weisstein, Prime-generating polynomial, 2005. https://mathworld.wolfram.com/.