Subcontests
(4)non-constant arithmetic progression, existence of a sequence
Let n≥k≥3 be integers. Show that for every integer sequence 1≤a1<a2<...<ak≤n one can choose non-negative integers b1,b2,...,bk, satisfying the following conditions:[*] 0≤bi≤n for each 1≤i≤k,
[*] all the positive bi are distinct,
[*] the sums ai+bi, 1≤i≤k, form a permutation of the first k terms of a non-constant arithmetic
progression.