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.