Library / /25 of 75

, 2003

Algebra Difficulty 4.6 AIME Prove it Italy

Problem:

Let $x_{0}, x_{1}, x_{2}, \ldots$ be the sequence defined by $x_{0}=2$ and $x_{n+1}=5+\left(x_{n}\right)^{2}$ for every $n \geq 0$ . Prove that this sequence does not contain any prime numbers other than 2.

Solution

Solution:

Note that the numbers in question are alternately even and odd, because $5$ is added to the square of the previous term. Therefore only the terms in odd position can give other primes. But these are all multiples of $3$ and greater than or equal to $x_{1}=9$ . Indeed the sequence is clearly increasing, and in passing from $x_{n}$ to $x_{n+2}=5+\left(5+x_{n}\right)^{2}=30+10\left(x_{n}\right)^{2}+\left(x_{n}\right)^{4}$ divisibility by $3$ is preserved.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from it; metadata (topic, difficulty) added by this project.