Prime numbers demystified 155 150
DOI:
https://doi.org/10.31686/ijier.vol9.iss6.3154Abstract
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 1.2.4.5.10.3.7.3.1.7.26.18.11.1. This makes even smaller primes useful for encryption as well.
References
J.J O’Connor and E. F. Robertson. January 1999. History of Eratosthenes, http://www-groups.dcs.st-and.ac.uk/history/Biographies/Eratosthenes.html
mathworld.wolfram.com/PrimeSpiral.html
David Conlon, Jacob Fox, and Yufei Zhao. Green- Tao theorem; An Exposition. http://people.maths.ox.ac.uk/~conlond/green-tao-expo.pdf
J.J O’Connor and E. F. Robertson. Euclid of Alexandria. http://www-history.mcs, st-andrews.ac.uk/Biographies/Euclid.html. 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: https://doi.org/10.1098/rspa.2009.0126
Martin Weissman. April 2, 2018. 6.47 a.m. EDT Why prime numbers still fascinate mathematicians, 2300 years later.
Downloads
Additional Files
Published
Issue
Section
License
Copyright (c) 2021 Artwell Ncube
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
Copyrights for articles published in IJIER journals are retained by the authors, with first publication rights granted to the journal. The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author for more visit Copyright & License.
