Prime numbers demystified


  • Artwell Ncube Unisa



The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about prime numbers. All the numerous arithmetic series patterns observed between various prime numbers are clearly explained with an elegant "pattern of remainders". With this algorithm we prove that odd numbers too can make an Ulam spiral contrary to current ""proofs". At the end of the paper this author proves the relationship between a simple arithmetic series pattern and the Riehmann's prime numbers distribution equation. This paper would be important for encryption too. As an example, prime integer 1979 is expressed as This makes even smaller primes useful for encryption as well.


Download data is not yet available.


J.J O’Connor and E. F. Robertson. January 1999. History of Eratosthenes,

David Conlon, Jacob Fox, and Yufei Zhao. Green- Tao theorem; An Exposition.

J.J O’Connor and E. F. Robertson. Euclid of Alexandria. http://www-history.mcs, JOC/EFR ©January 1999

B. Luque and Lucas Lacasa. Proceedings of the Royal Society, 2009, The first digit frequency of prime numbers and Riemann zeta zeros. DOI:

Martin Weissman. April 2, 2018. 6.47 a.m. EDT Why prime numbers still fascinate mathematicians, 2300 years later.


Additional Files



How to Cite

Ncube, A. (2021). Prime numbers demystified. International Journal for Innovation Education and Research, 9(6), 131–145.