Maths Olympiad Prep

Library / /21 of 61

Algebra Difficulty 5.4 AIME, harder Prove it Ibero-American Mathematical Olympiad

Problem:
Let an,bna_{n}, b_{n} be two sequences of integers such that:
(1) a0=0a_{0}=0, b0=8b_{0}=8;
(2) an+2=2an+1an+2a_{n+2}=2 a_{n+1}-a_{n}+2, bn+2=2bn+1bnb_{n+2}=2 b_{n+1}-b_{n},
(3) an2+bn2a_{n}^{2}+b_{n}^{2} is a square for n>0n>0.
Find at least two possible values for (a1992,b1992)\left(a_{1992}, b_{1992}\right).

Solution

Solution:
ana_{n} satisfies a standard linear recurrence relation with general solution an=n2+An+ka_{n}=n^{2}+A n+k. But a0=0a_{0}=0, so k=0k=0. Hence an=n2+Ana_{n}=n^{2}+A n. If you are not familiar with the general solution, then you can guess this solution and prove it by induction.

Similarly, bn=Bn+8b_{n}=B n+8. Hence an2+bn2=n4+2An3+(A2+B2)n2+16Bn+64a_{n}^{2}+b_{n}^{2}=n^{4}+2 A n^{3}+(A^{2}+B^{2}) n^{2}+16 B n+64. If this is a square, then looking at the constant and n3n^{3} terms, it must be (n2+An+8)2\left(n^{2}+A n+8\right)^{2}. Comparing the other terms, A=B=±4A=B= \pm 4.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.