How might I prove that an n-length subset of {1,2,..2n-2} must have at least 2 consecutive members?
Pigeonhole principle: prove that any set of $n+1$ integers from $\{1,2,...,2n\}$ has two consecutive integers differ by one.