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 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.
Esta página no tiene el aspecto habitual porque WIMS no ha podido reconocer
su navegador web.
Por favor, observe que las páginas de WIMS se generan interactivamente; no son
archivos HTML ordinarios. Deben usarse interactivamente y estando conectados. Es inútil
que las almacene con un programa automático.
- Description: write an even integer as sum of two primes. This is the main site of WIMS (WWW Interactive Multipurpose Server): interactive exercises, online calculators and plotters, mathematical recreation and games
- Keywords: wims, mathematics, mathematical, math, maths, interactive mathematics, interactive math, interactive maths, mathematic, online, calculator, graphing, exercise, exercice, puzzle, calculus, K-12, algebra, mathématique, interactive, interactive mathematics, interactive mathematical, interactive math, interactive maths, mathematical education, enseignement mathématique, mathematics teaching, teaching mathematics, algebra, geometry, calculus, function, curve, surface, graphing, virtual class, virtual classes, virtual classroom, virtual classrooms, interactive documents, interactive document, number,number_theory, integers, primes, Goldbach