Browse · MathNet
PrintChina Mathematical Competition (Extra Test)
China algebra
Problem
Suppose an infinite sequence satisfies , , , .
(1) Find all real numbers and that satisfy the statement: there exists a positive integer , such that, for , is a constant.
(2) Find an explicit expression for .
(1) Find all real numbers and that satisfy the statement: there exists a positive integer , such that, for , is a constant.
(2) Find an explicit expression for .
Solution
(1) We have If there exists a positive integer such that , we get If , we have If , then and Multiplying equations (3) and (4), we get From (5) we infer that and satisfy either (2) or Conversely, if and satisfy either (2) or (6), then constant when and the constant can only be either or .
(2) From (3) and (4), we get Let . Then, for , equation (7) becomes Then we get here, From (9) we get The range of in (10) can be extended to negative integers. For example, . Since (8) holds for any , we get here are determined by (10).
(2) From (3) and (4), we get Let . Then, for , equation (7) becomes Then we get here, From (9) we get The range of in (10) can be extended to negative integers. For example, . Since (8) holds for any , we get here are determined by (10).
Final answer
(1) Exactly those initial pairs with either absolute value of y equal to one and x not equal to minus y, or absolute value of x equal to one and y not equal to minus x. In these cases the sequence is constant from the second index onward with value either one or minus one. (2) For all nondegenerate cases, a_n = [(x + 1)^{F_{n-2}} (y + 1)^{F_{n-1}} + (x - 1)^{F_{n-2}} (y - 1)^{F_{n-1}}] / [(x + 1)^{F_{n-2}} (y + 1)^{F_{n-1}} - (x - 1)^{F_{n-2}} (y - 1)^{F_{n-1}}] for n at least zero, where F_0 = F_1 = 1 and F_n = F_{n-1} + F_{n-2}.
Techniques
Recurrence relations