Main Article Content
The essence of this paper is to furnish a simple prime sieving technique which deletes composites from a nite list of natural numbers ending with any given odd digit with the exception of the digit 5, leaving behind prime numbers ending with the given digit. This technique is so much like the Eratosthenes' sieving technique.
Daniele Lattanzi. Computational model of prime numbers by the modied chi-square function.Journal of Advances in Mathematics and Computer Science. SCIENCEDOMAIN International 10 Ufuoma; ARJOM, 15(1): 1-11, 2019; Article no.ARJOM.50417
Lattanzi D. Distribution of prime numbers by the modied chi-square function. Notes on Number Theory and Discrete Mathematics. 2015;21(1):18-30.
Graham RL, Knuth DE, Patashnik O. Concrete mathematics, addison-wesley publ. Company, Reading, MA; 1989.
Golomb SW. On the sum of the reciprocals of the fermat numbers and related irrationalities.Canadian Journal of Mathematics. 1963;15:475-478.
Grytczuk A, Luca F, Wjtowicz M. Another note on the greatest prime factors of fermat numbers. Southeast Asian Bulletin of Mathematics. 2001;25(1):111115.
O'Neill, Melissa E. The genuine sieve of eratosthenes. Journal of Functional Programming,Published online by Cambridge University Press. 2008;10-11.
Paul Pritchard. Fast compact prime number sieves. Journal of Algorithms. 1983;4:332344.
Baxter, Andrew. Sundaram's Sieve topics from the history of cryptography. MU Department of Mathematics.
Ramaswami Aiyar. Sundaram's Sieve for Prime Numbers. The Mathematics Student. 2(2):73.