Wikipedia: History of Goldbachs conjecture

Difference (from prior major revision) (minor diff, author diff)

Changed: 5c5,7

This conjecture has been researched by many number theorists and has been checked by computer for even numbers up to 4 * 10¹⁴. The majority of mathematicians believe that the conjecture is true, mostly based on statistical considerations focusing on the probabilistic distribution of prime numbers: the bigger the even number, the more "likely" it becomes that it can be written as a sum of two primes. We know that every even number can be written as the sum of at most six primes, and in 1966, Chen showed that every sufficiently large even number can be written as the sum of a prime and a number with at most two prime factors.

This conjecture has been researched by many number theorists and has been checked by computer for even numbers up to 4 × 10¹⁴.
The majority of mathematicians believe that the conjecture is true, mostly based on statistical considerations focusing on the probabilistic distribution of prime numbers: the bigger the even number, the more "likely" it becomes that it can be written as a sum of two primes.
We know that every even number can be written as the sum of at most six primes, and in 1966, Chen showed that every sufficiently large even number can be written as the sum of a prime and a number with at most two prime factors.

	Revision 12 . . (edit) December 3, 2001 7:19 pm by Zundark [×]
	Revision 11 . . December 3, 2001 6:53 pm by (logged).130.12.xxx
	Revision 10 . . October 16, 2001 3:28 am by (logged).64.38.xxx [Removed a reference to the 20th century, misleading since Sylvester was already aware of the probabilistic argument for Goldbach.]