Given are real numbers . For any pair of real numbers , define a sequence by for . Suppose that there exists a fixed nonnegative integer such that, for every choice of and , the numbers , in this order, form an arithmetic progression. Find all possible values of .
Solution
Note that (or ), gives a constant sequence, so it will always have the desired property. Thus, is one possibility. For the rest of the proof, assume . We will prove that and may take on any pair of values, for an appropriate choice of and . Use induction on . The case is trivial. Suppose that and can take on any value. Let and be any real numbers. By setting remembering that and , we get and . Therefore, and can have any values if and can. That completes the induction. Now we determine the nonzero such that form an arithmetic sequence; that is, such that . But because by the recursion formula, we can eliminate from the equation, obtaining the equivalent condition . Because the pair can take on any values, this condition means exactly that . Then , and , or . One root of this cubic is , and the remaining quadratic factor has the roots . Since each such gives an for which the condition holds, we conclude that the answer to the problem is , or .