11 positive integers are arranged on a circle. It appears that the difference between each two neighboring numbers is not less than 20, while the sum of each two neighboring numbers is not less than 100. Find the least possible value of the sum of all 11 integers.
Solution
Consider an arrangement that satisfies the conditions, and connect each pair of neighboring numbers with an arrow from the smaller to the larger. Since the total number of arrows is odd, there must be two consecutive arrows pointing in the same direction: . Then , , so , from which . All numbers except can be divided into 5 pairs of neighboring numbers; thus, the sum of all numbers is at least .
One example of an arrangement where this bound is achieved is shown in Fig. 17.
Second solution. Here is another proof that the sum is at least 580. Note that in any pair of neighboring numbers, one of them is at least 60 (if the larger is less than 60, then the other number is ...). Divide the remaining numbers into pairs of neighbors (the sum in each pair is at least 100, so the sum of all these 10 numbers is at least 500). Next, in each pair, mark the number that is at least 60; also mark the number . We have marked 6 numbers out of 11, so two of them are neighbors. Then the larger of them is at least , so . Therefore, the sum of all numbers is at least .