Paul Erdös (1913-96) Hungarian mathematician published more than 1500 papers, jointly or solo. He was always looking for elegant and simple solutions to complex problems. The following conjecture on limited prime differences can be attributed to his life-long investigations for prime numbers.
Given a prime number, p, every even number less than p can be expressed as the difference of two primes less than or equal to p. For example, if p=23 then 2=19-17, 4=17-13, 6=17-11, 8=19-11, 10=17-7, 12=19-7, 14=19-5, 16=19-3, 18=23-5, and 20=23-3. Obviously, this scheme failed for the even number 22 unless 1 is defined as a prime. However, if this is generalized to the group number of p then it works for all even numbers. The conjecture restated as: There are infinitely many primes, p, such that every even number belonging to the group number G(p)-1 can be expressed as the difference of two primes less than or equal to p. This can be proved algorithmically using simply a sieve of Diophantus.


LinkBack URL
About LinkBacks
Reply With Quote


