Problem:
Let be the sequence defined recursively as follows:
(The first terms of the sequence are thus ) Find all pairs of positive integers such that is a perfect square.
Problem:
Let be the sequence defined recursively as follows:
(The first terms of the sequence are thus ) Find all pairs of positive integers such that is a perfect square.
Solution:
We will show that the only pair satisfying the conditions of the problem is . (Clearly there is also a solution if for every , but in this case is not a pair; whether or not this case has been considered has no bearing on the grading anyway).
We may of course assume, by symmetry, that .
For , using the fact that , we can also write .
Observe that for we have , so, if a prime divides both and , then it divides .
However, 5 divides if and only if it divides : it follows that if a term of the sequence is not divisible by 5, neither is the following one. Since is not divisible by 5, no term of the sequence is divisible by 5.
This shows that and never have common prime divisors, so is a perfect square if and only if both and are: we therefore look for which perfect squares occur in the sequence.
Certainly and are squares, so is a solution.
On the other hand, since , for the number is of the form and hence, in particular, leaves remainder 2 upon division by 3. Now it is easy to check that no square has this property, since the square of a multiple of 3 is a multiple of 3 while the square of a number of the form is and hence leaves remainder 1 upon division by 3. Hence there are no other solutions besides the one found.
Alternatively, in a perhaps more elementary form, since for we have , we can study the equation with positive integers.
Multiplying both sides by 4 we obtain
Since 5 is only divisible by and , there are only the two possibilities and , which lead respectively to and . The number 1, however, cannot appear in the sequence, because and each term is larger than the previous one.
We deduce again that no perfect squares appear in the sequence, apart from (which are not expressed in the form ).