Given are sequences {xn} and {yn} by the following recurrent relations: x1=1, y1=39 and xn+1=23xn+yn+2,yn+1=551xn+24yn+64. Prove that xn is a perfect square for all positive integer n.
Solution
xn+1=23xn+yn+2, yn+1=551xn+24yn+64. Multiplying the first equation by 24 then subtracting these two, we get yn+2=24xn+1−xn+18. And we have xn+2=23xn+1+yn+1+2. Adding last two equations, we have xn+2=47xn+1−xn+1(∗) Thus, xn+1=47xn−xn−1+18. Subtracting these two equations, we get xn+2=48xn+1−48xn+xn−1(∗∗). Let an=xn. It suffices to prove that an is integer for n∈N. From x1=1 and y1=39, we get x2=64 and x3=3025. Then (∗) is equivalent to an+22=48an+12−48an2+an−12. From this, an+22−(49an+12−14an+1an+an2)=an−12−(49an2−14anan+1+an+12) and an+22−(7an+1−an)2=an−12−(7an−an+1)2,n∈N. Furthermore, (an+2+an−7an+1)(an+2+7an+1−an)=(an−1−7an+an+1)(an−1+7an−an+1). Let bn=an+2+an−7an+1, then b1=a3+a1−7a2=3025+1−764=0. bn(2an+2−bn)=bn−1(2an−1−bn−1) holds for n∈N(∗∗). Applying for n=2, we get b2(2a1−b2)=b1(2a1−b1)=0. Thus, b2=0 or 2a4−b2=0. Since xn is monotonically increasing, an is monotonically increasing too. Hence 2an+2−bn=an+2+7an+1−an>0. Therefore, b2=0. Applying (∗∗∗) for n∈N, bn=0. Hence an+2=7an+1−an, for n∈N. Since a1 and a2 are integers, an is integer for n∈N.
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.