The famous Goldbach conjecture states that any even number larger than 2 is the sum of two prime numbers. Despite efforts of mathematicians during several centuries, this apparently very simple conjecture is still not yet proved (at the time when this page is written: 1999).

This page has no intention of bringing help to the proof of this conjecture. It simply computes the decompositions into sums of 2 primes, for a number given by you. Its aim is to give you the indication that the big even numbers tends rather to have more and more different such decompositions.

The large primes appearing in the decompositions are only probable primes. You can use the tool Primes to run rigorous primality verifications on them.

The most recent versionPlease take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.

- Description: write an even integer as sum of two primes. serveur web interactif avec des cours en ligne, des exercices interactifs en sciences et langues pour l'enseigment primaire, secondaire et universitaire, des calculatrices et traceurs en ligne
- Keywords: math, interactif, exercice,qcm,cours,classe,biologie,chimie,langue,interactive mathematics, interactive math, server side interactivity,exercise,qcm,class, number,number_theory, integers, primes, Goldbach