# Goldbach

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 centries, 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.

Give your even number: n =

Type of the search:

• Different decompositions of a same number.
• One decomposition for each even number starting from the given one.
Number of decompositions by reply:

The most recent version

This page is not in its usual appearance because WIMS is unable to recognize your web browser.

In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press Enter''.

Please 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. interactive exercises, online calculators and plotters, mathematical recreation and games

Keywords: interactive mathematics, interactive math, server side interactivity, number,number theory, integer, prime, Goldbach