The proof of the Goldbach's Conjecture is one of the biggest still unsolved problems regarding prime numbers. Originally expressed in 1742 by the mathematician Christian Goldbach, from whom the conjecture takes its name, it was rephrased by Euler in the form in which we know it today:

**Every even number greater than 2 can be expressed as a sum of two prime numbers.**

In spite of the empirical evidence and the simplicity of its statement, the conjecture is resisting to every attempts of proof since almost three centuries. Several mathematicians have proved some weaker versions of the conjecture.

The statement phrased by Christian Goldbach is a "conjecture", so, as a matter of principle, it is a hypothesis. This means that it can be:

- True, that is all even numbers greater than 2 can be expressed as a sum of two prime numbers;
- False, that is at least one even number greater than two exists, which cannot be written as a sum of two prime numbers.

Currently, there are several attempts to prove the Goldbach's conjecture, which are complete, in the sense that they come to the conclusion, but contain a series of problems, so they have not been considered valid by the international community. We instead propose some proof strategies, which are still far from being complete, but already contain interesting and unrefuted (so far) intermediate results. We hope this material will be a useful starting point for who, like us, has started looking for a proof...

- True, that is all even numbers greater than 2 can be expressed as a sum of two prime numbers;
- False, that is at least one even number greater than two exists, which cannot be written as a sum of two prime numbers.

Goldbach's conjecture is put into the field of Number theory, the branch of Mathematics which studies the properties of integer numbers. In order to understand the proofs of the results similar to the conjecture, and very likely also to prove the conjecture itself, a sound knowledge of number theory is required. But this kind of knowledge rarely is part of a mathematician's curriculum...

Dashed line theory is a new mathematical theory which studies the connection between the sequence of natural numbers and their divisibility relationship. Typical problems are the computation of the n-th natural number divisible by at least one of k fixed numbers, or not divisible by any of them. Due to this nature, the theory is suited for studying prime numbers with a constructive approach, inspired to the sieve of Eratosthenes...

# Latest posts

Chen's Theorem is one of the closest theorems most similar to Goldbach's Conjecture known so far. It is the work of the Chinese mathematician Chen Jingrun, who published the proof in 1966. The best known form of the statement is the following: "Every sufficiently large even number is the sum either of two primes, or of a prime and a semiprime (i.e. a product of two prime numbers). However, this is only the abbreviated form of the Theorem: indeed Chen proved a more specific result, where he tries to estimate in how many ways an even number can be represented…

In this post we'll complete the proof of the prime number Theorem, applying the fundamental ideas described in the previous post. We'll split this last part of the proof into five parts: Our starting point will be a simple overestimation of the integral of |V| in any interval, obtained by applying Property A.18; We'll improve the result of the previous point supposing that within the interval the function V has at least one zero; We'll improve the result of the first point also for the intervals in which the function V has no zeroes; We'll compute how long the length…

In this post we’ll see what are the basic ideas of the second part of the prime number Theorem proof. Up to now we proved that α ≤ β′, where α and β′ are two important constants connected with the function V. As we saw, if we proved that α = 0 we would have proved the prime number Theorem. In order to prove that, a first idea may be proving that che β′ = 0, because it would follow that α ≤ β′ = 0, hence α = 0. In this post we’ll try to prove that β′ =…

With this post we'll conclude the main part of the Prime Number Theorem proof, which is based on the relationship between the constants α and β which have been introduced in the post The integral mean value and the absolute error function R. By Lemma N.7, in order to prove the Prime Number Theorem it's sufficient to prove that α = 0: in this post we'll approach this result.

Looking back to the path travelled so far, we can identify a turning point: it was when we introduced Hypothesis N.1, which consists in an inequality with an integral inside it. At that point, in order to simplify, we decided to replace the integral with a summation and, since then, we have always worked with summations, up to the proof of Selberg's Theorem and some consequences of it. Now it's time to return to the integral form, for resuming the argument which brought us to Hypothesis N.1, trying to prove it.