The Magic of the Prime Sites
.By Herb Wiggins, M.D.; Clinical Neurosciences; Discoverer/Creator of the Comparison Process/CP Theory/Model; 14 Mar. 2014. Copyright © April 2022
Magic of the Prime Sites
Have written 5 other articles from the discovery of the first major and original finding of the prime sites, via the Wiggins prime sieve. Essentially, this is a repeating pattern of the primes sites, which recur throughout the number lines every 3 sets of 30 numbers in the same, regular positions. These are found very easily by the primary assumption, empirically proven, that all of the primes after 10 end in the odd numbers, 1, 3, 7, 9. When this list of 11, 13, 17, 19; f/by the cast out three (c/o3) Rem2 21, 23, 27, 29; and the last c/o3 Rem0, 31, 33, 37, 39, we find at once & see the primes in large numbers and in a very strict, absolute, repeating prime site, positional series.
Adding 30, to Rem1 11, 13, 17, 19, and we get 41, 43, 47, and 49. all four of which can be prime, but for 7 sq., 49. Observe the 21 series and we get 21, 23, 27, 29, but again, 21 and 27 and 51, and 57 are divisible by 3 and thus leaving only 23 and 29, plus 30, 53 and 59 are primes. Rem0 31, 33, 37, and 39, we see the same c/o3 rem0 61, 67, and 33 and 39 are not prime, being 3 multiples. & adding 30 again, for obvious reasons of the prime quartets repeating, every 30 numbers, we get 61, and 67 as prime.
This abolute, repeating pattern of the prime sites has been missed, and it easily & quickly by recurring & the written prime sites, reduces the number line by 74%. thus speeding up 4 fold the prime sieves. In addition the finding that the 11, 13, 17, 19, twin primes are also seen again and again, do & have FOUR possible primes, makes it easier to find at least 1/2 the primes at once.
There are in fact patterns within these patterns as well. and by using a computer program to add up all digits before the last 1, 3, 7, 9, we can cast/out 3’s and determine if those are Rem1, Rem2, or Rem0(zero) quartets. Thus ANYWHERE in the number line, we can rapidly find the prime sites, as those recur and are the ONLY places in the number lines where primes can fall. It’s possible, using this system, to figure out primes using pen and ink only, up to about 33,800.
This is an absolute, and empirically tested by Dugas and O’Connor, who found all the some 54.8+Millions of primes to 1,000,000,000. Made all the easier by the last 50 primes they found, ALL of which, without fail, fall exactly on those same repeated prime site quartets, too.
999,999,751 & 999,999757 are very easy to do a c/o 3 on and thus prove those are all primes in the prime sites, too. & also 999,999,191, –193, –197, all Rem1 sites, thus 4 possible of which 3 are there, as well. These absolute prime site patterns hold throughout the entire number line no matter how large.
Further, when the Psq., prime squared, plus 2p, +4p, plus 2P, plus 4P, et seq., series are used, to remove prime only composites, that works to remove, exactly and meticulously, all prime composites, as well. Thus speeding up prime finding once again, by the simplest known, prime composite removals.
& if we have the highest known prime, no matter how many millions of digits, and we do a c/o3 on that, we can determine which prime quartet it falls into, Rem1, Rem2, and Rem3, and search for the closest Rem1 quartet, which will quickly by AKS & other related very fast, deterministic prime detectors, find any another, higher prime(s) in a very, very short time, as well.
That this imperils the 100’s of digits RSA system is a moot point. So let the readers beware!!
That is the power of this new understanding of the primes.
Further, when we repeatedly add up the prime series of Prime sq. plus 2p, plus 4p, etc., the prime composites generated also generate the prime number sites as well, and thus, when the prime composites are removed, very easily, it creates the prime number line, as a fall back test and check.
Further, using the +2p/+4p series system, numbers ending in 5 are found. And those numbers Are repeated for each prime series, such as 7, by 10 and 20 fold, as well. Find the first 7 series -5, and more -5 ending composites at 70 and 140 from those will be found, continuously. So we can rise very far, very fast, such as for prime series 41, numbers ending in -5, repeating at 410 and 820 units, and find the primes around those numbers ending in 5, too. This pattern goes through the entire number line as well, and increasingly faster, as the prime series get into scores of numbers long, all ending in 1, 3, 7, 9, as per the quartets, too.
So a very quick, simple method has been found to find all of the primes, no matter how large, given only the limits of the c/o3 method and the simple application of the deterministic AKS and related methods, too. Thus using a compound system (my prime sieve and AKS related methods, also programmable), and a good computer, we can find the primes roughly 1200 to as much as 10K times faster than ever before.
That is a revolution in finding new, higher primes for banking security, as well as vastly improves our understanding of the prime numbers, & number theory, too. Or as the prime expert stated, if we could find a repeating pattern in the primes, then we can speed up finding the primes
That has now been found, discovered and its major details elucidated.
What this means for the Twin Prime Hypothesis is a simple 3-4 line proof. We now know that, empirically, the Rem1 quartets, 11, 13, and 17,19 are twin primes, and the last twin prime 29, 31 are ALL repeated throughout the number line, repeating every 30 digits, that thus the only known 3 prime sites for twin primes are seen without limits, tho rarer as humbers get very large, as well. The Twin Prime hypothesis thus is a trivial proof, QED. When we simply write down the primes site number line, then we simplify the proofs of that.
Find the right, true assumptions and the logic follows, and so do the proofs. That is the magic of this prime sites discovery.
When we look at the putative 6N +/-1, we see at once the problems with that. Too many numbers ending in -5, which cannot be prime. & it misses 87 as well as others. So the assumption that all primes are covered and found by it, is NOT a good assumption. And also it calls 49, 77, 91, 119 and 121 all primes, which they are not!. It does not eliminate the prime composites at all. The prime sites model finds those and by a simple 4 term equation eliminates the prime composites, at once. Which 6N+/-1 does not and cannot do.
The above follows & findings apply to Goldbach’s as well.
The proof of Rieman’s conjecture and series being the case can also be done using these prime site assumptions as well. Thus Riemann’s is very likely the case, too. Will let the astute figure out that one as well..
& there it is, and where is the $1M for that? Grin.