In 1975, Szemeredi proved that any set of integers of positive density must contain arbitrarily long arithmetic progressions. This result solved a 40 year old conjecture of Erdos and Turan. Furthermore, it was one of the main ingredients used by Green and Tao in their proof that the primes contain arbitrarily long arithmetic progressions. In this talk we will discuss the easiest case of Szemeredi's Theorem: arithmetic progressions of length 3.