Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
