Given the sequences {xn}n=0∞,{yn}n=0∞ satisfy x0=1,x1=4,xn+2=3xn+1−xn(n=0,1,2,⋯); y0=1,y1=2,yn+2=3yn+1−yn(n=0,1,2,⋯). (1) Prove: For all non-negative integers n, xn2−5yn2+4=0; (2) If positive integers a,b satisfy a2−5b2+4=0, prove: There exists a non-negative integer k, such that xk=a,yk=b.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
Four (1) Prove by mathematical induction: xn2−5yn2+4=0 and 5yn+1yn−xn+1xn=6(n=0,1,2,⋯).
First, when n=0 and n=1, according to the initial values of {xn} and {yn}, it can be verified that equation (1) holds. Assume that equation (1) is correct for n⩽k+1(k⩾0). For n=k+2, xk+22−5yk+22+4=(3xk+1−xk)2−5(3yk+1−yk)2+4=9(xk+12−5yk+12)+(xk2−5yk2)+6(5yk+1yk−xk+1xk)+4=9(xk+12−5yk+12+4)+(xk2−5yk2+4)+6(5yk+1yk−xk+1xk−6),
By the induction hypothesis, all three terms in the above equation are 0, so xk+22−5yk+22+4=0, 5yk+3yk+2−xk+3xk+2−6=5(3yk+2−yk+1)yk+2−(3xk+2−xk+1)xk+2−6=3(5yk+22−xk+22)−(5yk+2yk+1−xk+2xk+1)−6=−3(xk+22−5yk+22+4)−(5yk+2yk+1−xk+2xk+1−6),
By the induction hypothesis, both terms in the above equation are 0, so 5yk+3yk+2−xk+3xk+2=0. Thus, equation (1) holds for n=k+2. Therefore, equation (1) holds for all non-negative integers n. So, for all non-negative integers n, we have xn2−5yn2+4=0. (2) Proof by contradiction. Assume there exist positive integers a,b such that a2−5b2+4=0, but there does not exist a non-negative integer k such that xk=a,yk=b, and assume that a,b are the smallest such numbers. We will prove that (23a−5b,23b−a) is also a pair of positive integers satisfying the conditions. First, a2−b2=4(b2−1) is even, so a and b have the same parity, and 3a and 5b,3b and a have the same parity, respectively, so 23a−5b∈Z,23b−a∈Z. Clearly, if one of a,b is 1, then the other is also 1. This is the first term of {xn} and {yn}, which does not satisfy the assumption, so a⩾2,b⩾2.
Combining 23a−5b>0 (otherwise a⩽35b⇒b2⩽1.8, contradiction), 23b−a>0 (otherwise a⩾3b⇒b2⩽−1, contradiction), we have 23a−5b∈N∗,23b−a∈N∗.
And (23a−5b)2−5(23b−a)2+4=a2−5b2+4=0, so (23a−5b,23b−a) is also a pair of numbers satisfying the conditions.
By 23a−5b<a (otherwise a⩾5b⇒b2⩽−51, contradiction), 23a−5b is a number in {xn}, otherwise (23a−5b,23b−a) is also a pair of positive integers satisfying the conditions, which contradicts the minimality of a. So there exists a non-negative integer k such that xk=23a−5b. The characteristic equation of {xn} and {yn} is the same, t2−3t+1=0, with roots t1,2=23±5, so xn and yn both have the form A⋅(23+5)n+B⋅(23−5)n. Using the initial values x0=y0=1,x1=4,y1=2, we determine the coefficients by undetermined coefficients, and get xn=21+5⋅(23+5)n+21−5⋅(23−5)n,yn=105+5⋅(23+5)n+105−5⋅(23−5)n.