Problems involving arithmetic progressions

Problems involving arithmetic progressions are of interest in number theory, combinatorics, and computer science, both from theoretical and applied points of view. == Largest progression-free subsets == Find the cardinality (denoted by Ak(m)) of the largest subset of {1, 2, ..., m} which contains no progression of k distinct terms.