Maths Olympiad Prep

Library / /819 of 860

Algebra Difficulty 5.6 AIME, harder Find the answer

Given are real numbers x,yx, y. For any pair of real numbers a0,a1a_{0}, a_{1}, define a sequence by an+2=xan+1+yana_{n+2}=x a_{n+1}+y a_{n} for n0n \geq 0. Suppose that there exists a fixed nonnegative integer mm such that, for every choice of a0a_{0} and a1a_{1}, the numbers am,am+1,am+3a_{m}, a_{m+1}, a_{m+3}, in this order, form an arithmetic progression. Find all possible values of yy.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Note that x=1x=1 (or x=0x=0 ), y=0y=0 gives a constant sequence, so it will always have the desired property. Thus, y=0y=0 is one possibility. For the rest of the proof, assume y0y \neq 0. We will prove that ama_{m} and am+1a_{m+1} may take on any pair of values, for an appropriate choice of a0a_{0} and a1a_{1}. Use induction on mm. The case m=0m=0 is trivial. Suppose that ama_{m} and am+1a_{m+1} can take on any value. Let pp and qq be any real numbers. By setting am=qxpy(a_{m}=\frac{q-x p}{y}( remembering that y0)y \neq 0) and am+1=pa_{m+1}=p, we get am+1=pa_{m+1}=p and am+2=qa_{m+2}=q. Therefore, am+1a_{m+1} and am+2a_{m+2} can have any values if ama_{m} and am+1a_{m+1} can. That completes the induction. Now we determine the nonzero yy such that am,am+1,am+3a_{m}, a_{m+1}, a_{m+3} form an arithmetic sequence; that is, such that am+3am+1=am+1ama_{m+3}-a_{m+1}=a_{m+1}-a_{m}. But because am+3=(x2+y)am+1+xyama_{m+3}=\left(x^{2}+y\right) a_{m+1}+x y a_{m} by the recursion formula, we can eliminate am+3a_{m+3} from the equation, obtaining the equivalent condition (x2+y2)am+1+(xy+1)am=0\left(x^{2}+y-2\right) a_{m+1}+(x y+1) a_{m}=0. Because the pair am,am+1a_{m}, a_{m+1} can take on any values, this condition means exactly that x2+y2=xy+1=0x^{2}+y-2=x y+1=0. Then x=1/yx=-1 / y, and 1/y2+y2=01 / y^{2}+y-2=0, or y32y2+1=0y^{3}-2 y^{2}+1=0. One root of this cubic is y=1y=1, and the remaining quadratic factor y2y1y^{2}-y-1 has the roots (1±5)/2(1 \pm \sqrt{5}) / 2. Since each such yy gives an xx for which the condition holds, we conclude that the answer to the problem is y=0,1y=0,1, or (1±5)/2(1 \pm \sqrt{5}) / 2.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.