5,656 views
This video is part of a relatively simple explanation of the proof of Goldbach's Conjecture, which is published in two PDF manuscripts (in English) as preprints in a large repository of scientific works called HAL Ouvertes. In the first part of the proof (first manuscript) it is shown that every sufficiently large even number can be written as a sum of two prime numbers (Every sufficiently large even number is the sum of two primes). In order to prove this statement, in this first video a sieve is introduced such that given an even number x it allows finding pairs of primes that added together give the number x. This sieve can be thought of (and thus explained) as a double sieve of Eratosthenes; later a formulation of this sieve implemented in a sequence of k-tuples is introduced. In subsequent videos the steps necessary to arrive at the complete proof of Goldbach's Conjecture will be explained.