Problems Involving Arithmetic Progressions
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
High Quality Content by WIKIPEDIA articles! Problems involving arithmetic progressions are of interest in number theory, combinatorics, and computer science, both from theoretical and applied points of view. Find the cardinality (denoted by Ak(m)) of the largest subset of [0, 1, ..., m – 1] which contains no progression of k distinct terms. The elements of the forbidden progressions are not required to be consecutive. For example, A4(10) = 8, because [0, 1, 2, 4, 5, 7, 8, 9] has no arithmetic progressions of length 4, while all 9-element subsets of [0, 1, ..., 9] have one. Paul Erdos set a $1000 prize for a question related to this number, collected by Endre Szemeredi for what has become known as Szemeredi's theorem. Szemeredi's...
ISBN: 978-6-1336-8260-3
Издательство:
Книга по требованию
Дата выхода: июль 2011