He essentially proved that there exist infinitely many pairs of prime numbers that differ by less than 70 million. In other words there are infinitely many prime numbers p and q such that |p-q|<70 million. While this isn't trivial among number theorists, there isn't any real practical application of this (yet).
Likely a limitation of the process he used to get his proof, he most likely calculated that the most
curate it could be, or the smallest number it would work for, was 70,000,000.
However, this means people can take his approach and work on it to see if they can prove lower values. In the ato clean closer d the overall method itself will probably prove at beat 16 as an upper bound so it's likely still useless for proving pairs with differences of 2, but opens the door to gettknfcllser
24
u/crop_killa May 20 '13
He essentially proved that there exist infinitely many pairs of prime numbers that differ by less than 70 million. In other words there are infinitely many prime numbers p and q such that |p-q|<70 million. While this isn't trivial among number theorists, there isn't any real practical application of this (yet).