What Exactly Is Goldbach's Conjecture?
Goldbach’s conjecture is a very old and famous unsolved problem in mathematics. It was proposed in 1742 by the mathematician Christian Goldbach. The conjecture is very simple, but it has still not been proven. It says:
Every even number greater than 2 can be written as the sum of two prime numbers.
A prime number is a positive integer that can only be divided by 1 and itself, such as 2, 3, 5, 7, 11, and so on. According to Goldbach’s conjecture, for example:
4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7, or 10 = 5 + 5
…and so on.
In real life, you can imagine it as a party game. Suppose you have an even number of candies. Your task is to divide them into two piles, and the number of candies in each pile must be a prime number. Goldbach’s conjecture says that no matter how many candies you have, as long as the number is even and greater than 2, you can always complete this task.
This conjecture is easy to understand, but proving it has been a difficult problem mathematicians have worked on for hundreds of years and still have not solved. That is why it has become an important challenge and mysterious unsolved puzzle in mathematics.