A New and Simple Prime Sieving Technique for Generating Primes Ending with a Given Odd Digit

Main Article Content

Okoh Ufuoma

Abstract

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.

Keywords:
Prime numbers, prime sieve.

Article Details

How to Cite
Ufuoma, O. (2019). A New and Simple Prime Sieving Technique for Generating Primes Ending with a Given Odd Digit. Asian Research Journal of Mathematics, 15(1), 1-11. https://doi.org/10.9734/arjom/2019/v15i130139
Section
Original Research Article

References

Jose William Porras Ferreira. Primes and squares challenge. Journal of Scientic Research & Reports. 2016;10(2):1-3. Article no.JSRR.24252 SCIENCEDOMAIN International

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.
DOI:10.4153/CJM-1963-051-0

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.
DOI:10.1007/s10012-001-0111-4

O'Neill, Melissa E. The genuine sieve of eratosthenes. Journal of Functional Programming,Published online by Cambridge University Press. 2008;10-11.
DOI:10.1017/S0956796808007004

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.
ISSN 0025-5742