/Congettura-di-Goldbach

Every even number greater than 2 can be written as the sum of two prime numbers

Primary LanguageC

Goldbach's conjecture

😱 Every even number greater than 2 can be written as the sum of two prime numbers.

Goldbach's conjecture is one of the oldest unsolved problems in number theory.

The image shows the number of ways in which a number n can be written as a sum of two primes for n ≤ 1 000 000.

For example:

  • 4 = 2 + 2
  • 6 = 3 + 3
  • 8 = 3 + 5
  • 10 = 3 + 7 = 5 + 5
  • 12 = 5 + 7
  • 14 = 3 + 11 = 7 + 7

In 1742, the Prussian mathematician Christian Goldbach wrote a letter to Euler in which he proposed the following conjecture:

 Every integer greater than 5 can be written as a sum of three prime numbers.

Euler, taking an interest in the problem, responded by reformulating the problem in the following equivalent version:

 Every even number greater than 2 can be written as the sum of two prime numbers.

Euler's version is the form in which the conjecture is currently formulated and is sometimes also called the strong Goldbach conjecture. Goldbach's weak conjecture, which is implied by the strong conjecture, asserts that all odd numbers greater than 5 can be written as a sum of three primes.

The statement formulated by Christian Goldbach is a "conjecture", therefore, in principle, it is a hypothesis. This means that it could be:

 True, i.e. all even numbers greater than 2 can be expressed as the sum of two prime numbers;
 False, i.e. there exists at least one even number greater than 2 which cannot be written as the sum of two prime numbers.

Both hypotheses are open, and scholars from all over the world are following different paths to find a solution to what has become in all respects an enigma.