Skip to main content

The Goldbach Conjecture

  • Chapter
Basic Analytic Number Theory

Abstract

In this chapter we investigate the question of the representation of an odd integer N as the sum of three prime numbers (the Goldbach Conjecture). We shall prove I.M. Vinogradov’s theorem on the asymptotic formula for the number of representations of N as the sum of three primes, from which it will follow that every sufficiently large odd number can be written as the sum of three primes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Karatsuba, A.A., Nathanson, M.B. (1993). The Goldbach Conjecture. In: Basic Analytic Number Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58018-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58018-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63436-9

  • Online ISBN: 978-3-642-58018-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics