Suppose you have a set S of integers from {1 , 2 , … , N} that
contains at least N / C elements. Then for large enough N , must S
contain three equally spaced numbers (i.e., a 3-term arithmetic
progression)?
In 1953, Roth showed that this is indeed...