Vinogradov's theorem

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers.

It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five.

It is named after Ivan Matveyevich Vinogradov, who proved it in the 1930s.

Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption.

The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes.

The notion of "sufficiently large" was ill-defined in Vinogradov's original work, but in 2002 it was shown that 101346 is sufficiently large.

[1][2] Additionally numbers up to 1020 had been checked via brute force methods,[3] thus only a finite number of cases to check remained before the odd Goldbach conjecture would be proven or disproven.

In 2013, Harald Helfgott proved Goldbach's weak conjecture for all cases.

for all sufficiently large N. By showing that the contribution made to r(N) by proper prime powers is

, one sees that This means in particular that any sufficiently large odd integer can be written as a sum of three primes, thus showing Goldbach's weak conjecture for all but finitely many cases.

denotes the number of representations restricted to prime powers

can be given by the distribution of prime numbers in residue classes modulo

Hence, using the Siegel–Walfisz theorem we can compute the contribution of the above integral in small neighbourhoods of rational points with small denominator.

The set of real numbers close to such rational points is usually referred to as the major arcs, the complement forms the minor arcs.

It turns out that these intervals dominate the integral, hence to prove the theorem one has to give an upper bound for

In 1937 Vinogradov gave an unconditional upper bound for

His argument began with a simple sieve identity, the resulting terms were then rearranged in a complicated way to obtain some cancellation.

Hence the integral over the minor arcs can be bounded above by which gives the error term in the theorem.