Vinogradov's three prime theorem states that every sufficiently large odd number $N$ can be written in terms of the sum of three odd primes. We will give a very light sketch of the proof of Vinogradov's three prime theorem and give a comparison to the previous talk on Roth's theorem to arithmetic progressions.