in our e-book Prime Passages to Paradise
by H. PeterAleff
Volume 1: Patterns of prime distribution
in "polygonal - number pyramids"
1.1. The misleading prime number sieve of Eratosthenes
Many mathematicians, and other people curious about numbers, have long searched for patterns in the distribution of primes, that is, those whole numbers which can be evenly divided only by themselves and by one, and which seem to pop up randomly among the more frequent non- prime or composite numbers.
Even in this day and age where people have the internet, they can connect anytime and anywhere with O2 or any other company; yet, many of them still don't know everything there is to know about numbers, in particular about primes.
The problem dates back at least to Eratosthenes of Cyrene (280 to 194 BCE), the acclaimed scholar and head of the Library at Alexandria in Egypt who wrote the first surviving description of the sieve for prime numbers now named after him.
In proposing this sieve, or method for locating the primes, Eratosthenes may have lived up to his reputation of being the "beta" expert in each of his many erudite pursuits, that is, the next best to the first or "alpha" specialists in those subjects2.
His sieve hides the order inherent among the primes, whereas some other simple methods for arranging the sequence of numbers display a series of organized visual patterns formed by primes which you will see described here. Moreover, the circumstantial evidence I will present in the second Volume of this book suggests that the leading mathematicians of his host country may have known some of these number- inherent and orderly patterns long before he was born.
The method Eratosthenes used to weed out non- prime numbers is still the only practical one known, and it forms the basis of all modern sieve theory : list the numbers up to an arbitrarily chosen target square, then cross out the successive multiples of all the primes up to the root of that square.
The entries that remain are not multiples of those only factors that would be small enough to produce them if they were multiplied with any of the other not- crossed- out numbers which are all larger than that square root. These left-over entries are therefore primes.
However, that method and its simple logic are so obvious to anyone experimenting with multiplication and its reversal that it can hardly be this latecomer’s invention.
By then, people had been multiplying and dividing and studying numbers for thousands of years, and whoever marks the multiples of the successive primes among, say, the first hundred numbers, notices quickly that all the multiples of eleven and up in that set are already tagged as multiples of smaller numbers.
The contribution more credibly associated with Eratosthenes is the arrangement of the so weeded number patch in the form of a square sieve.
To construct this sieve, one chops up the line of natural numbers into stretches as long as the root of the limiting square, then stacks these line segments in consecutive layers one number-space high so that they form a square array, as illustrated in Figure 1 above.
This array has often been used as a visual demonstration that primes occur in no discernible order, and it may not be the best way of writing the numbers for studying patterns formed by primes.
However, it illustrates one of the reasons why Eratosthenes’ contemporaries may have honored him with that high ranking, right next to the luminaries of his time. These included his friend Archimedes of Syracuse (287 to 212 BCE) who was one of the few outstanding giants among the many great mathematicians whose name and work survive. There was also his longtime co- Alexandrinian Apollonius of Perga (262 to 190 BCE3) whose systematic study of the conic sections and their tangents is still the mathematical foundation of modern astronomy and space travel. Coming in second to these was no mean feat.
Square arrays led to rectangular ones, and these are very useful tools for the arithmetic of residue classes which deals with the remainders left over from dividing a number by the width of a rectangular array. Those remainders are a convenient way to organize all the infinitely many numbers into as few categories as the array has columns.
All numbers with the same remainder share the same column in such an array. Often they have other traits in common, too, beginning with the two- column separation into odd and even, and with the ten- wide array of our decimal system where the members of each column have always the same last digit. Similarly, our seven- day week is a rectangular array that counts the days left over since the last completed multiple of seven.
Rectangular arrays have also contributed much to the study of primes. For instance, as Figure 2 illustrates, arrays four and six units wide each sort the primes above 2 and 3 into only two of their columns, those of the forms 4n ± 1 and 6n ± 1 which each have distinctive properties.
The six-wide array supplies also a simple visual proof that all twin prime centers above 4 are multiples of six because all entries in the only other odd column 6n ± 3 are divisible by 3 and can thus not contain the prime needed next to a twin prime center on either side.
1.2. Proving the twin prime conjecture
The six- wide array further helps to demonstrate the otherwise still unproven conjecture that there must be infinitely many twin primes, that is ...
Contact us at recoveredscience.com