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 ] [n/2,n - 2] . We show that 210 is the largest value of n for which this upper bound is attained.
Cite
CITATION STYLE
APA
Deshouillers, J.-M., Granville, A., Narkiewicz, W., & Pomerance, C. (1993). An upper bound in Goldbach’s problem. Mathematics of Computation, 61(203), 209–213. https://doi.org/10.1090/s0025-5718-1993-1202609-9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free