Problem statement

Let n be a positive integer, and consider a sequence a1 , a2 , . . . , an of positive

integers. Extend it periodically to an infinite sequence a1 , a2 , . . . by defining
an+i = ai for all i ≥ 1. If a1 ≤ a2 ≤ · · · ≤ an ≤ a1 + n and

aai ≤ n + i − 1 for i = 1, 2, . . . , n,

prove that a1 + · · · + an ≤ n2 .

Solution
We assume that a1 < n as all other cases are trivial. By:

a1 ≤ a2 ≤ · · · ≤ an ≤ a1 + n

This gives the bound ai ≤ 2n − 1 for all i. (In retrospect, I don’t think this
bound is useful to my solution).
We now have the following important claim. For any term greater than n, let
n − k represent its index, and xn−k be a positive number, that represents how
much greater it is than n. Then,

an−k = n + xn−k =⇒ axn−k ≤ n − k − 1

Which is easily proven by contradiction.

For example, if k = 3, then we have:

an−3 = n + xn−3 =⇒ axn−3 ≤ n − 4

And a concrete example is,

an = n + 1 =⇒ a1 ≤ n − 1

Also note that in no case can we have n − k ≤ xn−k , or there is a contradiction.

This is important later on, as it means that the set of terms greater than n, and
the set of terms for which the size conditions are set (those smaller than n), are
distinct.
Now, set n to anything, and we prove for any set of terms greater than n, the
total sum will be less than or equal to n2 .
Say we have u + 1 terms greater than n:

n + xn ≥ n + xn−1 ≥ · · · ≥ n + xn−u

Then we have this set of conditions for the other terms:

1
 axn ≤ n − 1
axn−1 ≤ n − 2
axn−2 ≤ n − 3
...
axn−u ≤ n − u − 1

All terms less than n + xn−u are less than or equal to n. We need to prove the
sum of their differences to n is greater or equal to the sum of xi .
We maximise all these terms: Any term without a size condition becomes n, and
any term with, becomes as big as it can (e.g. if xn < i ≤ xn , we set ai = n − 1,
and so on). This uses the fact that the terms are increasing). It is sufficient
to show this maximum leads to a sum less than or equal to n2 , and any other
choice will have a lower sum.
There is a natural bijection between the two sets. There are xn terms less than
one, corresponding to and cancelling out that axn = n + xn . And we also have
xn−1 terms less than two, corresponding to axn−1 = n + xn−1 . If we think of
this in terms of operations (or like induction), each subsequent axn−i essentially
decreases the other set’s total sum by xn−i . By this, the sum of this maximal
set must be equal to n2 .