Maths Olympiad Prep

Library / /419 of 426

Algebra Difficulty 7.4 National Olympiad, round 2 Prove it Saudi Arabia

Let P(x)P(x) be a nonconstant integer polynomial and positive integer nn. The sequence a0,a1,a_0, a_1, \ldots is defined by a0=na_0 = n and ak=P(ak1)a_k = P(a_{k-1}) for k1k \ge 1. Given that for each positive integer bb, the sequence contains a bb-th power of some positive integer greater than 1. Prove that degP=1\deg P = 1.

Solution

Suppose degP2\deg P \ge 2.

Let d=degP2d = \deg P \ge 2. Then for large kk, aka_k grows very rapidly, since ak=P(ak1)a_k = P(a_{k-1}) and PP is a degree dd polynomial with integer coefficients.

Let bb be any positive integer. By assumption, there exists kk such that ak=mba_k = m^b for some integer m>1m > 1.

Let us fix nn and consider the sequence a0,a1,a_0, a_1, \ldots. Since PP is a nonconstant integer polynomial, for large kk, aka_k will be very large and will have many prime divisors (by Zsigmondy's theorem, for example, or by the fact that the sequence grows rapidly and is not eventually constant).

But for aka_k to be a perfect bb-th power for every bb, for every bb there must exist kk such that aka_k is a perfect bb-th power. In particular, for bb large, aka_k must be a perfect bb-th power, i.e., ak=mba_k = m^b for some m>1m > 1.

But for large bb, the gap between consecutive perfect bb-th powers grows very rapidly. For example, for b=100b = 100, the numbers 2100,3100,4100,2^{100}, 3^{100}, 4^{100}, \ldots are extremely far apart. Since aka_k grows rapidly, but PP is fixed, the sequence aka_k cannot hit perfect bb-th powers for all bb unless PP is linear.

More precisely, for d2d \ge 2, aka_k grows as a tower of exponents, so for large kk, aka_k is much larger than (ak1)2(a_{k-1})^2, and so on. The set of perfect bb-th powers is very sparse for large bb, so it is impossible for the sequence aka_k to hit a perfect bb-th power for every bb unless PP is linear.

Now, suppose degP=1\deg P = 1, i.e., P(x)=ax+bP(x) = ax + b with a,bZa, b \in \mathbb{Z}, a0a \ne 0.

Then aka_k is an affine recurrence, so ak=akn+bak1a1a_k = a^k n + b \frac{a^k - 1}{a - 1} (if a1a \ne 1), which is an explicit formula. For suitable nn, aka_k can be made to hit perfect bb-th powers for all bb (for example, if a=1a = 1, P(x)=x+bP(x) = x + b, then ak=n+kba_k = n + k b; for a=1a = -1, P(x)=x+bP(x) = -x + b, aka_k alternates, but for suitable nn and bb, aka_k can be a perfect bb-th power).

Therefore, the only possibility is degP=1\deg P = 1.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.