MathDB
Sums of pairs in a sequence

Source: USAJMO 2010, Problem 2

April 29, 2010
pigeonhole principlearithmetic sequenceUSAJMOinduction

Problem Statement

Let n>1n > 1 be an integer. Find, with proof, all sequences x1,x2,,xn1x_1 , x_2 , \ldots , x_{n-1} of positive integers with the following three properties: (a). x1<x2<<xn1x_1 < x_2 < \cdots < x_{n-1} ; (b). xi+xni=2nx_i + x_{n-i} = 2n for all i=1,2,,n1i = 1, 2, \ldots , n - 1; (c). given any two indices ii and jj (not necessarily distinct) for which xi+xj<2nx_i + x_j < 2n, there is an index kk such that xi+xj=xkx_i + x_j = x_k.