The title rimes not primes with the 2002 movie title ‘Mothman Prophecies’ starring Richard Gere, my closest successful and famous twin primes in the space-time continuum. He was born in August 31, 1949. But the man who really loved math dancing was Paul Erdős (pronounced “air-dish”). He died on September 20, 1996 at the age of 83. His lifelong legacies were his works on every mathematical problem he thought of or sought of. His prophecy is that mathematical truth is humanly attainable, if not in this life then in the afterlife or in the next life. Although he sincerely hoped for the privilege of finding the truth himself, he was also quite giving and willing to award monetary tokens to others who found it first. He wrote, collaborated, and co-authored 1475 research publications. Many of these are considered by the mathematical community as foundational to the uninterrupted progressive advancements of mathematics while others further solidify mathematical confidence among them. As a true mathematical space-time traveler, he wrote his own epitaph: Finally I am becoming stupider no more.
In the limited context of this thread, only two of his numerous conjectures are to be discussed. First is the conjecture that every even number is the difference of two larger prime numbers. For example, 2=7-5 or 2=13-11 or 2=19-17 or 2=31-29 or 2=43-41 or 2=61-59 or 2=73-71 or 2=103-101 or 2=109-107 or 2=139-137 or 2=151-149 or 2=181-179 or 2=193-191 or 2=199-197 or 2=229-227 so on and so forth. There are infinitely many pairs of larger primes associated with infinitely many lesser even numbers that satisfy this particular conjecture. Although the number 2 is an even number it is the one and only even prime and also the first and the smallest prime number. Moreover, these infinitely many pairs of larger primes: (5,7), (11,13), (17,19), (41,43), (59,61), (71,73), (101,103), (107,109), (137,139), (149,151), (179,181), (191,193), (197,199), (227,229), so on and so forth are all classified as twin primes as studied by number theory. Secondly, the conjecture for the efforts to prove that there are infinitely many sets of twin primes is known as the twin primes conjecture. Both conjectures can become useful in cryptology for creating the ultimate unbreakable codes. Nonetheless, both can simply be algorithmically proven using a sieve of Diophantus to which Erdős and Diophantus are giving their silent blessings from the afterlife.


LinkBack URL
About LinkBacks
Reply With Quote


