MathDB
BxMO 2015, Problem 4

Source: Benelux Mathematical Olympiad 2015, Problem 4

May 10, 2015
combinatoricsarithmetic sequence

Problem Statement

Let nn be a positive integer. For each partition of the set {1,2,,3n}\{1,2,\dots,3n\} into arithmetic progressions, we consider the sum SS of the respective common differences of these arithmetic progressions. What is the maximal value that SS can attain?
(An arithmetic progression is a set of the form {a,a+d,,a+kd}\{a,a+d,\dots,a+kd\}, where a,d,ka,d,k are positive integers, and k2k\geqslant 2; thus an arithmetic progression has at least three elements, and successive elements have difference dd, called the common difference of the arithmetic progression.)