dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Message for dCode's author:

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Goldbach Conjecture tool. Thank you.

Informatically, it is verified for all the even integers up to one billion of billion (and surely more advantage today because calculations are still in progress).

The program is limited to even integers less than 10^9 and also limited in number of decompositions.

What is the demonstration of the Goldbach's conjecture?

As the name suggests it is a conjecture, so to date it has no mathematical demonstration. Mathematicians suppose it to be true, and it is computer-verified up to very large numbers, but it does not prove that it is true for all numbers.

What is the verification algorithm of the Goldbach conjecture?

The algorithm is similar to that of a prime factors decomposition. It is possible to speed up the calculations by using an already calculated list of prime numbers.