However, those reports invariably overlooked the mathematical aspects of the achievement, particularly the curious properties of the two numbers 714 and 715. It took the efforts of mathematicians Carol Nelson, David E. Penney, and Carl Pomerance to call attention to this facet. (See Numberphile episode "Aaron Numbers" featuring Carl Pomerance).
Notice that 714 = 2 x 3 x 7 x 17 and 715 = 5 x 11 x 13; so 714 x 715 = 2 x 3 x 5 x 7 x 11 x 13 x 17. In other words, the product of the two consecutive integers 714 and 715 is equal to the product of the first seven prime numbers!
Pomerance and his colleagues wondered whether there were other pairs of consecutive numbers whose product is also the product of the first k primes.
The first few instances are easy to find: 1 and 2 (1 x 2 = 2), 2 and 3 (2 x 3 = 2 x 3), 5 and 6 (5 x 6 = 2 x 3 x 5), 14 and 15 (14 x 15 = 2 x 3 x 5 x 7), and 714 and 715.
The mathematicians then used a computer to search for such pairs, going as far as products of the first 3,049 primes (numbers up to 6,021 digits long). They found no additional examples in that range. It’s now conjectured that 714 and 715 is the last pair of consecutive integers whose product is the product of the first k primes for some k.
And there's more. Notice that the sum of the prime factors of 714 is 2 + 3 + 7 + 17 = 29, and the sum of the prime factors of 715 is 5 + 11 + 13 = 29. How often do two consecutive numbers have prime factors that add up to the same total?
Pomerance and his coworkers conducted another computer search, looking for such pairs up to a value of 20,000. Here are the first few examples:
Within a week of the appearance of these results in a 1974 issue of the Journal of Recreational Mathematics, Pomerance received a letter from legendary mathematician Paul Erdős (see "Paul Erdős and an Infinity of Problems"). Erdős offered to show Pomerance how to prove the conjecture.
Pomerance invited Erdős to Georgia, and the meeting resulted in a joint paper giving the proof, which was published in 1978. It was the first of more than 40 papers that the two mathematicians would write together.
During his lifetime, Erdős collaborated with so many mathematicians that these efforts have been captured in something called the Erdős number. Erdős is assigned the number 0. People who have coauthored a paper with him are given the number 1. People who have coauthored a paper not with Erdős but with someone who coauthored a paper with Erdős get the number 2, and so on.
Pomerance noted that many years after his initial collaboration with Erdős, Emory University awarded honorary degrees to both Erdős and Aaron. Pomerance was invited to that occasion, and he asked both recipients to autograph a baseball for him. In effect, Hank Aaron joined the elite ranks of those having Erdős number 1! Even though Aaron didn't have a joint paper with Erdős, he did have a joint baseball.
In the meantime, the search for Ruth-Aaron pairs continued. In 1996, John L. Drost reported that a computer search yielded 149 pairs below 1,000,000. Somewhat later, Joe K. Crump developed a method for generating Ruth-Aaron pairs. It hasn't yet been proved, however, that the number of such pairs is infinite.
Drost went on to look for other analogously interesting sets of numbers. For example, he found a triple with equal prime sums: 417162 = 2 x 3 x 251 x 277; 417163 = 17 x 53 x 463; and 417164 = 2 x 2 x 11 x 19 x 499. All have prime sums of 533. Is there another such triple? No one knows.
Going back to 714 and 715, there’s still more. Note that 714 + 715 = 1429. Notice anything about 1429? It’s a backwards-forwards-sideways prime, which means that 1429, 9241, 1249, 9421, 4129, 4219 are all prime numbers. What about 1492? That was the year that Christopher Columbus stumbled upon America.
Originally posted August 7, 2005
No comments:
Post a Comment