Sign up for email alert when new content gets added: Sign up
The prior paper “Principles of Prime Numbers - Part I - New Definition of Prime Numbers with ModNt Number System & Induction” must be read to put this paper into perspective. That paper is a summary of three books “Calculate Primes” (2007), “Principles of Prime Numbers – Volume I” (2010) and “Breaking RSA Codes” (2014). Another peer reviewed paper can be included in the list of prior papers “New Definition of Prime Numbers with Sppn Tables and Proofs by Induction”. In the prior books and papers, the concept of direct calculation of prime numbers was presented. It showed that the prime numbers constitute a complete number system modNt with a new visual representation in the form of “Sppn and Rppn Tables”. The understanding of Prime Numbers as a complete system of mathematics generated from Peano’s Postulates continues with visualizations of the results of using the “McCanney Generator Function” which directly calculates prime numbers in groups. The base N modulo number systems (e.g. the most common of which is mod10 or base 10) are shown to be inadequate to understand the true nature of Prime Numbers, which are the building blocks of all mathematics. It was shown that the mod10 or other base N number systems have been the hinderance to true understanding. The new modNt number system gives complete logical meaning to the prime numbers since every digit is related to the ancestry of the specific prime number showing them to have a unique “heritage” or “ancestry” back to the alpha prime 0 (zero). Many unexpected results arise on the order and properties of the prime numbers.
+447723598358
