✦ScienexySCIENCE KNOWLEDGE LIBRARY
concept · SCI-MAT-119

Goldbach's Conjecture

Goldbach's conjecture is one of the most famous unsolved problems in number theory. It states that every even integer greater than 2 can be expressed as the sum of two prime numbers.

NameExpressionDescription

Strong Goldbach conjecture

For every even integer n > 2, there exist primes p and q such that n = p + q.

The central statement of the strong Goldbach conjecture.

Weak Goldbach conjecture

For every odd integer n > 5, there exist odd primes p, q, and r such that n = p + q + r.

The related statement about representing odd integers as sums of three odd primes.

Explanation

Goldbach's conjecture is a statement about the additive properties of prime numbers. In its commonly studied strong form, it states that every even integer greater than 2 can be written as the sum of two primes. For example, 10 = 3 + 7 and 28 = 11 + 17. The conjecture is named after Christian Goldbach, who discussed a related statement in correspondence with Leonhard Euler in the eighteenth century. The modern strong form is still unproved. It has been tested computationally for extremely large ranges, and substantial theoretical progress has been made, but checking many examples does not establish that the statement is true for every even integer. A related statement is the weak Goldbach conjecture, which states that every odd integer greater than 5 can be expressed as the sum of three odd primes. The weak conjecture was proved by Harald Helfgott in 2013. The study of Goldbach-type problems connects additive number theory with prime distribution, analytic methods, sieve theory, and computational mathematics. Researchers investigate how many representations an even number has as a sum of two primes and how that number may vary as the integer becomes larger.

Variables

SymbolMeaning

n

An even integer greater than two in the strong conjecture, or an odd integer greater than five in the weak conjecture.

p, q

Prime numbers whose sum equals n in the strong conjecture.

p, q, r

Odd prime numbers whose sum equals n in the weak conjecture.

Example or application

A worked example has not yet been added.

Definition

Goldbach's strong conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers.

Purpose

To describe a fundamental proposed relationship between the distribution of prime numbers and the additive structure of even integers.

Importance

Goldbach's conjecture is a major open problem in number theory. It illustrates how a simple statement about prime numbers can lead to deep mathematical questions and has motivated extensive work in analytic number theory, sieve methods, and computational verification.

Key Concepts

  • Prime numbers

  • Even integers

  • Additive number theory

  • Strong Goldbach conjecture

  • Weak Goldbach conjecture

  • Prime representations

  • Computational verification

  • Analytic number theory

  • Sieve methods

  • Unsolved mathematical problems

Characteristics

  • The strong conjecture concerns even integers greater than two.

  • It requires each even integer to be represented as a sum of two primes.

  • A single valid representation is sufficient for an individual even integer.

  • The conjecture remains unproved in its strong form.

  • Computational verification can confirm finite ranges but cannot prove the universal statement.

  • The related weak Goldbach conjecture has been proved.

  • The problem is closely connected with the distribution of prime numbers.

Types

NameDescription

Strong Goldbach conjecture

States that every even integer greater than 2 is the sum of two primes. It remains an open problem.

Weak Goldbach conjecture

States that every odd integer greater than 5 is the sum of three odd primes. It was proved by Harald Helfgott in 2013.

Goldbach representations

The different pairs of prime numbers whose sum equals a specified even integer.

Components

NameDescription

Even integer

The integer greater than two that is being represented as a sum.

Prime summands

The two prime numbers whose sum is the selected even integer.

Representation

A pair of prime numbers that satisfies the required addition equation.

Conjecture

A mathematical statement proposed as true but not yet established by a complete proof.

Computational verification

The checking of individual cases or finite ranges using computer calculations.

Properties

  • Every prime number greater than two is odd.

  • The sum of two odd integers is even.

  • The strong conjecture includes the even integer 4, represented as 2 + 2.

  • The strong conjecture remains unproved.

  • The weak conjecture was proved in 2013.

  • A number can have more than one Goldbach representation.

  • Computational evidence for many cases is not equivalent to a proof for all integers.

Examples

ProblemSolutionResult

Represent 18 as the sum of two primes.

7 and 11 are both prime, and 7 + 11 = 18.

18 = 7 + 11.

Find two different Goldbach representations of 30.

30 = 7 + 23 and 30 = 13 + 17. Each pair consists of two prime numbers.

Two representations are 30 = 7 + 23 and 30 = 13 + 17.

Represent 21 as a sum of three odd primes.

3, 5, and 13 are odd primes, and their sum is 21.

21 = 3 + 5 + 13.

Applications

  • Research in additive number theory

  • Study of prime-number distribution

  • Computational verification of mathematical conjectures

  • Development of sieve methods

  • Analytic number theory

  • Research into prime representations

  • Exploration of unsolved mathematical problems

Prerequisites

  • Prime numbers

  • Even and odd integers

  • Integer addition

  • Prime factorization

  • Basic divisibility

  • Fundamental concepts of mathematical proof

Learning Objectives

  • State the strong Goldbach conjecture.

  • Explain the meaning of a Goldbach representation.

  • Find prime pairs whose sum equals a given even integer.

  • Distinguish the strong and weak Goldbach conjectures.

  • Understand why computational verification is not a universal proof.

  • Identify the current mathematical status of the two conjectures.

  • Recognize the connection between Goldbach's conjecture and additive number theory.

Common Mistakes

  • Confusing the strong and weak Goldbach conjectures.

  • Assuming that a conjecture becomes a theorem after many examples are verified.

  • Using composite numbers as prime summands.

  • Forgetting that the strong conjecture concerns even integers greater than two.

  • Claiming that the strong Goldbach conjecture has been proved.

  • Assuming that every even number has only one prime representation.

Practice Questions

  • State the strong Goldbach conjecture.

  • What is the difference between the strong and weak Goldbach conjectures?

  • Express 24 as a sum of two primes.

  • Find two different prime representations of 40.

  • Why does the sum of two odd primes produce an even integer?

  • Has the strong Goldbach conjecture been proved?

  • What is the mathematical status of the weak Goldbach conjecture?

  • Why can computational verification not replace a general mathematical proof?

Key Takeaway

Goldbach's strong conjecture proposes that every even integer greater than two is the sum of two primes, and despite extensive evidence, it remains an unsolved problem.

Related Topics

  • Prime Numbers

  • Distribution of Prime Numbers

  • Prime Number Theorem

  • Twin Prime Conjecture and Unsolved Problems in Number Theory

  • Additive Number Theory

  • Sieve Methods

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Arithmetic & Number Theory