Let k be a positive integer and let x0,x1,x2,… be an infinite sequence defined by the relationship x0x1xn+1=0=1=kxn+xn−1for all n≥1.
a. For the special case k=1, prove that xn−1xn+1 is never a perfect square for n≥2.
b. For the general case of integers k≥1, prove that xn−1xn+1 is never a perfect square for n≥2.
Solution
We claim that, for all n≥1, xn−1xn+1=xn2+(−1)n.(10) Based on this, if k>1 we then have xn=kxn−1+xn−2≥kxn−2≥k≥2 for n≥2, so xn2±1 cannot be a square number. If k=1 then x2=2 and xn=xn−1+xn−2≥xn−2≥2 for n≥3 and the same conclusion holds. With k=1 and n=2 we have xn−1xn+1=x1x3=2 which is not a square number.
To prove (10) by induction, we first settle the base case n=1: x0x2−x12=−1=(−1)1. We now suppose that xn−1xn+1=xn2+(−1)n for some n≥1 and use the recurrence relation xn+2=kxn+1+xn and kxn=xn+1−xn−1 to find xnxn+2=xn(kxn+1+xn)=kxnxn+1+xn2=(xn+1−xn−1)xn+1+xn2=xn+12−xn−1xn+1+xn2=xn+12−(xn2+(−1)n)+xn2=xn+12+(−1)n+1. This completes the proof by induction.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.