Tool to check the Goldbach conjecture. The Goldbach conjecture proposes that any even integer number (greater than 2) can be written as the sum of two prime numbers.

Goldbach Conjecture - dCode

Tag(s) : Arithmetics

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!

A suggestion ? a feedback ? a bug ? an idea ? *Write to dCode*!

The Goldbach conjecture is a still unproved proposition that any even integer (strictly greater than 2) can be written as the sum of 2 prime numbers.

__Example:__ Decompositions in sum of 2 prime numbers: `4 = 2 + 2`,` 10 = 3 + 7 = 5 + 5`, and so on.

Informatically, it is verified for all the even integers up to several billions of billion.

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

The conjecture was proposed by the Prussian mathematician Christian Goldbach in 1742 in a letter to Leonhard Euler.

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.

Recent works like Vinogradov's theorem have shown that certain odd numbers can be expressed as the sum of three prime numbers. Or Terence Tao who demonstrated that any odd number can be written as the sum of at most 5 prime numbers.

Goldbach's weak conjecture is a hypothesis in number theory stating that any odd number strictly greater than 5 can be expressed as the sum of three prime numbers.

This conjecture is called *weak* because, if Goldbach's strong conjecture were proven, it would also lead to the validity of the weak conjecture. Indeed, if any even number greater than or equal to 6 can be decomposed into a sum of two prime numbers, adding the prime number 3 makes it possible to obtain a sum of three prime numbers, thus producing odd numbers greater than or equal to 9.

The only way to decompose 2 into a sum (called list of partitions of 2) are: `1+1` and `0+2`, as `0` and `1` are not prime numbers, it is not possible to verify Goldbach's conjecture for the number `2`.

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.

`// Javascript limited to n = 200`

var pr = new Array(3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97);

function goldback(n) {

for (p in pr) {

if (pr[p] <= n/2 && in_array(n-pr[p], pr)) {

return n+`=`+pr[p]+`+`+(n-pr[p]);

}

}

}

dCode retains ownership of the "Goldbach Conjecture" source code. Except explicit open source licence (indicated Creative Commons / free), the "Goldbach Conjecture" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Goldbach Conjecture" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Goldbach Conjecture" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!

Reminder : dCode is free to use.

The copy-paste of the page "Goldbach Conjecture" or any of its results, is allowed (even for commercial purposes) as long as you credit dCode!

Exporting results as a .csv or .txt file is free by clicking on the *export* icon

Cite as source (bibliography):

*Goldbach Conjecture* on dCode.fr [online website], retrieved on 2024-09-09,

goldbach,conjecture,prime,integer,even,goldback,calculator

https://www.dcode.fr/goldbach-conjecture

© 2024 dCode — El 'kit de herramientas' definitivo para resolver todos los juegos/acertijos/geocaching/CTF.

Feedback