An upper bound in Goldbach's problem
Abstract
It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [n/2,n - 2] . We show that 210 is the largest value of n for which this upper bound is attained.
- Publication:
-
Mathematics of Computation
- Pub Date:
- July 1993
- DOI:
- 10.1090/S0025-5718-1993-1202609-9
- Bibcode:
- 1993MaCom..61..209D