Maths Olympiad Prep

Library / /480 of 520

Algebra Difficulty 6.0 AIME, harder Prove it

Given a sequence of positive integers
{a1=1,a2=2.an+2=an+1+an(n1). \left\{\begin{array}{l} a_{1}=1, a_{2}=2 . \\ a_{n+2}=a_{n+1}+a_{n}(n \geqslant 1) . \end{array}\right.
(1) Prove that the infinite set of integer points formed by consecutive terms of the sequence
(a1,a2),(a3,a4),,(a2k1,a2k), \left(a_{1}, a_{2}\right),\left(a_{3}, a_{4}\right), \cdots,\left(a_{2 k-1}, a_{2 k}\right), \cdots

all lie on the curve x2+xyy2+1=0x^{2}+x y-y^{2}+1=0.
(2) If f(x)=xn+xn1anxan1,g(x)=x2x1f(x)=x^{n}+x^{n-1}-a_{n} x-a_{n-1}, g(x)=x^{2}-x-1, prove that g(x)g(x) divides f(x)f(x).

Solution

(1) Use mathematical induction.
It is obvious that {x=a1=1y=a2=2\left\{\begin{array}{l}x=a_{1}=1 \\ y=a_{2}=2\end{array}\right..
is on the curve. Now assume the integer point (a2k1,a2k)\left(a_{2 k-1}, a_{2 k}\right) is on the curve. Then we have
a2k12+a2k1a2ka2k2+1=0. a_{2 k-1}^{2}+a_{2 k-1} a_{2 k}-a_{2 k}^{2}+1=0 .

By completing the square and transforming, we get
(a2k1+a2k)2+(a2k1+a2k)(a2k1+2a2k)(a2k1+2a2k)2+1=0. Substituting an+2=an+1+an, we get a2k12+a2k+1a2k+2a2k+22+1=0. \begin{array}{l} \left(a_{2 k-1}+a_{2 k}\right)^{2}+\left(a_{2 k-1}+a_{2 k}\right)\left(a_{2 k-1}+2 a_{2 k}\right) \\ -\left(a_{2 k-1}+2 a_{2 k}\right)^{2}+1=0 . \\ \text { Substituting } a_{n+2}=a_{n+1}+a_{n} \text {, we get } \\ a_{2 k-1}^{2}+a_{2 k+1} a_{2 k+2}-a_{2 k+2}^{2}+1=0 . \end{array}

This shows that the integer point (a2k+1,a2k+2)\left(a_{2 k+1}, a_{2 k+2}\right) is on the curve x2+xyy2+1=0x^{2}+x y-y^{2}+1=0.
By mathematical induction, the integer points
(a1,a2),(a3,a4),,(a2k1,a2k), \left(a_{1}, a_{2}\right),\left(a_{3}, a_{4}\right), \cdots,\left(a_{2 k-1}, a_{2 k}\right), \cdots

are all on the curve x2+xyy2+1=0x^{2}+x y-y^{2}+1=0.
(2) Decompose f(x)f(x) according to the requirements of g(x)g(x), so that a common factor g(x)g(x) can be factored out, we have
f(x)=a1xn+(a2a1)xn1(an1+an2)xan1=a1xn+(a2a1)xn1+k=1n3(ak+2ak+1ak)xnk1(an1+an2)xan1=a1xn+a2xn1+k=1n3ak+2xnk1a1xn1k=1n3ak+1xnk1an1xk=1n3akxnk1an2xan1=k=1n1a1xnk+1k=1n1akxnkk=1n1akxnk1=(x2x1)k=1n1akxnk1. \begin{aligned} f(x)= & a_{1} x^{n}+\left(a_{2}-a_{1}\right) x^{n-1}-\left(a_{n-1}+a_{n-2}\right) x \\ & -a_{n-1} \\ = & a_{1} x^{n}+\left(a_{2}-a_{1}\right) x^{n-1} \\ & +\sum_{k=1}^{n-3}\left(a_{k+2}-a_{k+1}-a_{k}\right) x^{n-k-1} \\ & -\left(a_{n-1}+a_{n-2}\right) x-a_{n-1} \\ = & a_{1} x^{n}+a_{2} x^{n-1}+\sum_{k=1}^{n-3} a_{k+2} x^{n-k-1}-a_{1} x^{n-1} \\ & -\sum_{k=1}^{n-3} a_{k+1} x^{n-k-1}-a_{n-1} x-\sum_{k=1}^{n-3} a_{k} x^{n-k-1} \\ & -a_{n-2} x-a_{n-1} \\ = & \sum_{k=1}^{n-1} a_{1} x^{n-k+1}-\sum_{k=1}^{n-1} a_{k} x^{n-k}-\sum_{k=1}^{n-1} a_{k} x^{n-k-1} \\ = & \left(x^{2}-x-1\right) \sum_{k=1}^{n-1} a_{k} x^{n-k-1} . \end{aligned}

Since aka_{k} are all positive integers, g(x)=x2x1g(x)=x^{2}-x-1 divides f(x)f(x).

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.