Goldbach's conjecture

Goldbach's conjecture is one of the oldest and most famous unsolved problems in number theory and all of mathematics. It suggests a simple idea: every even natural number bigger than 2 can be written as the sum of two prime numbers.

Mathematicians have checked this idea for numbers up to 4×10¹⁸, but they have not yet proven it is always true. The conjecture remains a mystery that continues to challenge mathematicians today.

History

In 1742, a mathematician named Christian Goldbach wrote a letter to Leonhard Euler. He suggested that every even number bigger than 2 can be written as the sum of two prime numbers. Euler thought this was likely, but he could not prove it.

Many mathematicians have worked on this problem. They have tested it with very large numbers, up to 4×10¹⁸, and it seems true so far. However, a full proof is still one of the biggest unsolved puzzles in mathematics.

Formal statement

Goldbach's conjecture is a fun puzzle about numbers. It says that every even number bigger than 2 can be made by adding together two prime numbers. Prime numbers are special numbers greater than 1 that can only be divided by 1 and themselves, like 2, 3, 5, and 7.

There is also a weaker version of the conjecture. It states that every odd number greater than 7 can be written as the sum of three odd prime numbers. Mathematicians have checked these ideas for very big numbers, but they have not yet found a proof that works for all numbers.

Heuristic justification

Statistical ideas help us understand why Goldbach's conjecture might be true. For big even numbers, there are many ways to split them into two smaller numbers. The more ways there are, the more likely it is that both smaller numbers will be prime.

One simple way to think about this uses the idea that a random number has a small chance of being prime. For a big even number, if we pick a number close to half of it, we can guess the chance that both this number and what’s left after taking it away are prime. As the even number gets larger, the number of possible ways to write it as the sum of two primes grows very big. This suggests that large even numbers are very likely to be the sum of two primes, though this is just a guess and not a proof.

Goldbach partition function

The Goldbach partition function shows how many ways an even number can be written as the sum of two prime numbers. When we draw this information, it looks like a comet and is called Goldbach's comet. This comet helps us see patterns about how often even numbers can be made from two primes and how these patterns change with different numbers.

Related problems

Goldbach's conjecture leads to many interesting questions. For example, it suggests that every number greater than one can be written as the sum of at most three prime numbers.

There are also other fun problems similar to Goldbach's conjecture. A famous mathematician named Lagrange showed that every positive whole number can be written as the sum of four square numbers. Another guess, called Lemoine's conjecture, says that every large odd number is the sum of a prime number and twice another prime number.

In popular culture

Goldbach's Conjecture has been mentioned in many books and movies. It is the title of a biography by Xu Chi about the Chinese mathematician Chen Jingrun. The idea is important in stories like Uncle Petros and Goldbach's Conjecture by Apostolos Doxiadis, No One You Know by Michelle Richmond, and short stories such as Isaac Asimov’s "Sixty Million Trillion Combinations." It is also in films like the Spanish movie Fermat's Room and the French-Swiss movie Marguerite's Theorem. It is also part of the plot in Frederik Pohl’s story "The Gold at the Starbow's End."