Browse · MathNet
PrintBulgarian National Mathematical Olympiad
Bulgaria algebra
Problem
The sequence is defined by the equalities , and for every positive integer . Prove that no member of this sequence is equal to a perfect power (greater than one) of a positive integer.
Solution
We shall use the following assertion.
Lemma. Let be a positive integer. Then the equation does not have solutions in positive integers.
Proof. Assume that and are positive integers such that and is minimum possible. It is obvious that is even and is odd. Let us denote and . Then and . There are two possibilities: - if and , , , then , which gives a contradiction modulo 4; - if and , , , then , which leads to the equation , , where
we notice that . It is clear that the above argument of decreasing the degrees of 2 can be continued until we have degree at most 5. Therefore we reach the equation , where and , . Clearly, is odd and we set . We obtain , where . We have again two possibilities: - if and , , , then , whence . This leads to , , , , and finally , which is impossible; - if and , , , then , which contradicts to the choice of as minimal. This completes the proof of the lemma.
The roots of the characteristic equation of our sequence are . Therefore we find (using the conditions and ) Denote , . Then , and . Now, if is perfect power for some , then the last two equalities give a contradiction with the lemma.
Lemma. Let be a positive integer. Then the equation does not have solutions in positive integers.
Proof. Assume that and are positive integers such that and is minimum possible. It is obvious that is even and is odd. Let us denote and . Then and . There are two possibilities: - if and , , , then , which gives a contradiction modulo 4; - if and , , , then , which leads to the equation , , where
we notice that . It is clear that the above argument of decreasing the degrees of 2 can be continued until we have degree at most 5. Therefore we reach the equation , where and , . Clearly, is odd and we set . We obtain , where . We have again two possibilities: - if and , , , then , whence . This leads to , , , , and finally , which is impossible; - if and , , , then , which contradicts to the choice of as minimal. This completes the proof of the lemma.
The roots of the characteristic equation of our sequence are . Therefore we find (using the conditions and ) Denote , . Then , and . Now, if is perfect power for some , then the last two equalities give a contradiction with the lemma.
Techniques
Recurrence relationsPell's equationsInfinite descent / root flipping