AN UPPER BOUND IN GOLDBACH PROBLEM

Authors
DESHOUILLERS JM GRANVILLE A NARKIEWICZ W POMERANCE C
Citation
Jm. Deshouillers et al., AN UPPER BOUND IN GOLDBACH PROBLEM, Mathematics of computation, 61(203), 1993, pp. 209-213
Citations number
11
Categorie Soggetti
Mathematics,Mathematics
Journal title
Mathematics of computation → ACNP
ISSN journal
00255718
Volume
61
Issue
203
Year of publication
1993
Pages
209 - 213
Database
ISI
SICI code
0025-5718(1993)61:203<209:AUBIGP>2.0.ZU;2-B
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 interv al [n/2, n-2]. We show that 210 is the largest value of n for which th is upper bound is attained.