Goldbach's conjecture

Math has many big puzzles. One puzzle is very old.

It is about even numbers. An even number can be split into two equal parts. A man named Christian Goldbach had an idea. He thought every even number is made of two primes.

A prime is a special kind of number. We do not know if his idea is always true. Many people have tried to prove it. Computers have checked many numbers. They have not found a mistake yet. It is still a mystery.

Math has many big puzzles. One puzzle is very old.

This puzzle is called Goldbach's conjecture. It is about even numbers. An even number is a number like 4, 6, or 8. Christian Goldbach shared his idea in 1742. He thought every even number larger than 2 is the sum of two primes. A prime is a number that can only be divided by itself and 1. For example, 3 and 5 are primes. If you add them, you get 8. This is an even number.

Many smart people have tried to solve this. It is a very hard problem. We have not proven it is always true. However, we have checked many numbers with computers. They have checked even numbers up to 4,000,000,000,000,000,000. So far, they have not found a single mistake.

Some math ideas are easier to prove. One is called the weak conjecture. It says every odd number larger than 5 is the sum of three primes. Harald Helfgott proved this part. But the main even number puzzle is still a mystery.

Mathematics is full of puzzles that seem simple but are very hard to solve. One of the most famous puzzles is called Goldbach's conjecture.

This idea is about even numbers and prime numbers. A prime number is a number that can only be divided by itself and one. The conjecture says that every even number larger than two is the sum of two primes. For example, you can make the even number 8 by adding the primes 3 and 5. It sounds like a rule that should always work. However, no one has been able to prove it is true for every single number yet.

To understand how this works, you can try it with small numbers. If you take the even number 10, you can use the primes 3 and 7. If you take 12, you can use 5 and 7.

As numbers get much larger, there are actually many different ways to split them into two primes. If you graph these ways, the picture looks like a streak in the sky. Mathematicians call this shape Goldbach's comet.

This comet shape shows that larger even numbers usually have even more ways to be made from primes.

The story of this puzzle began a long time ago. On June 7, 1742, a mathematician named Christian Goldbach wrote a letter. He sent this letter to another famous mathematician named Leonhard Euler.

In the letter, Goldbach shared his idea about even numbers. Euler replied to him on June 30, 1742. Even though the math rules were slightly different back then, the core idea was the same. This simple letter started a mystery that has lasted for hundreds of years.

Many people have worked to solve parts of this mystery. In 1938, a man named Nils Pipping checked the rule for numbers up to 1,000,000,000. Later, computers allowed people to check much higher. A search by T. Oliveira e Silva checked numbers up to 4,000,000,000,000,000,000.

Other mathematicians like Chen Jingrun and Harald Helfgott found answers to similar problems. Helfgott proved a related idea called the weak Goldbach conjecture. This version says every odd number larger than five is the sum of three primes. Even with these big wins, the main even number puzzle remains unsolved.

This puzzle helps us understand how prime numbers are spread out. Prime numbers are like the building blocks of all other numbers. By studying how they add together, we learn more about the patterns in math. It is similar to other famous mysteries like the twin prime conjecture. Even if we cannot prove it yet, the search for the answer teaches us new things. It shows that even a simple question about counting can lead to deep discovery.

Goldbach's conjecture is a famous unsolved problem in number theory. It is one of the most well-known mysteries in all of mathematics. The conjecture states that every even natural number greater than 2 is the sum of two prime numbers. A prime number is a whole number greater than 1 that cannot be formed by multiplying two smaller natural numbers. This idea is often called the strong, even, or binary Goldbach conjecture. It matters because it explores how the building blocks of numbers, the primes, interact through addition.

To understand the mechanism, imagine taking any even number like 10 or 20. You look for two prime numbers that, when added together, equal that even number. For example, 10 can be written as 3 plus 7 or 5 plus 5. As even numbers grow larger, the number of ways to split them into two primes generally increases. This relationship is visualized through a function called the Goldbach partition function. When you graph this function, the resulting shape is known as Goldbach's comet.

Mathematicians distinguish between different versions of this problem. The strong conjecture involves even numbers and two primes. The weak Goldbach conjecture, or ternary Goldbach conjecture, involves odd integers. It states that every odd integer greater than 5 is the sum of three primes. If the strong conjecture is true, the weak version must also be true. This is because if an odd number is the sum of three primes, it can be viewed through the lens of the even conjecture. However, proving the weak version does not automatically prove the strong version.

The history of this puzzle began in the 18th century. On June 7, 1742, the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler. In this letter, Goldbach proposed his ideas about numbers. Euler replied on June 30, 1742, and discussed the mathematical relationships involved. Interestingly, the French mathematician René Descartes also wrote about a similar idea. He stated that every even number could be expressed as the sum of at most three primes. This was a weaker version of the idea Goldbach proposed.

Significant progress has been made using complex mathematical methods. In 1930, Lev Schnirelmann proved that any natural number greater than 1 is the sum of at most a certain number of primes. This number is known as Schnirelmann's constant. In 1937 and 1938, researchers showed that almost all even numbers can be written as the sum of two primes. In 1973, Chen Jingrun used sieve theory to show that every sufficiently large even number is either the sum of two primes or a prime and a semiprime. A semiprime is the product of two primes.

Modern computing has allowed us to verify the conjecture for incredibly large values. In 1938, Nils Pipping verified the conjecture up to 1,000,000,000. More recently, T. Oliveira e Silva ran a distributed computer search. This search verified the conjecture for numbers up to 4,000,000,000,000,000,000. One specific finding from this search was that 4,000,000,000,000,000,000 is the smallest number that cannot be written as a sum of two primes where one prime is smaller than 9781. These massive numbers show that the pattern holds even at scales humans cannot visualize.

There are deep connections between this conjecture and other mathematical fields. It is closely related to the twin prime conjecture, which is also considered very difficult to solve. Mathematicians also use probabilistic arguments to support the conjecture. These arguments suggest that as numbers get larger, the probability of finding prime pairs that sum to that number increases. The study of Goldbach's conjecture continues to drive advancements in sieve theory and prime number distribution research.