Chen’s theorem

  • Melvyn B. Nathanson
Part of the Graduate Texts in Mathematics book series (GTM, volume 164)

Abstract

In this chapter, we shall prove one of the most famous results in additive prime number theory: Chen’s theorem that every sufficiently large even integer can be written as the sum of an odd prime and a number that is either prime or the product of two primes.

Keywords

Prime Number Dirichlet Character Implied Constant Prime Number Theorem Large Sieve 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. Chen [10, 11] announced his theorem in 1966 but did not publish the proof until 1973, apparently because of difficulties arising from the Cultural Revolution in China. An account of Chen’s original proof appears in Halberstam and Richert’s Sieve Methods [44]. The proof in this chapter is based on unpublished notes and lectures of Henryk Iwaniec [67]. The argument uses standard results from multiplicative number theory (Dirichlet characters, the large sieve, and the Siegel-Walfisz and Bombieri-Vinogradov theorems), all of which can be found in Davenport [19]. Other good references for these results are the monographs of Montgomery [83] and Bombieri [3]. For bilinear form inequalities, see Bombieri, Friedlander, and Iwaniec [4].Google Scholar

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • Melvyn B. Nathanson
    • 1
  1. 1.Department of MathematicsLehman College of the City University of New YorkBronxUSA

Personalised recommendations