Additive combinatorics: Roth's theorem (that a dense subset of ${1,2,...,N}$ contains an arithmetic progression of length 3). It's extraordinary how much of the subject opens up once one has seen just this theorem proved, and it can be done quite easily from first principles.