Maths Olympiad Prep

Track / Stage 7 / 199 of 300 #2239 of 2604

Problem 2239

National Olympiad second round; IMO P1/P4
Algebra Difficulty 7.6 Prove it Balkan Mathematical Olympiad competition problems · Balkan Mathematical Olympiad

For a polynomial P∈R[x]P \in \mathbb{R}[x], let f(P)=nf(P) = n if nn is the smallest positive integer such that
(∀x∈R)(P(P(…P(x))… ))⏟n>0, (\forall x \in \mathbb{R}) \underbrace{(P(P(\dots P(x))\dots))}_{n} > 0,
and f(P)=0f(P) = 0 if such an integer nn does not exist. Does there exist a polynomial P∈R[x]P \in \mathbb{R}[x] of degree 201420152014^{2015} such that f(P)=2015f(P) = 2015?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

The answer is that it does exist such a polynomial. Actually we shall prove a more general result: Let ss be an even integer and t>1t > 1 be an arbitrary integer. Then for some constant c>0c > 0 for the polynomial P(x)=(x+1)s+c−1P(x) = (x+1)^s + c-1 (which is of degree ss) we have f(P)=tf(P) = t. Indeed:
The polynomial PP is strictly increasing function on the interval [−1,∞)[-1, \infty). Let xk(c)x_k(c) be the minimal value of the polynomial P(P(…P(x))… )⏟k\underbrace{P(P(\dots P(x))\dots)}_{k} for a fixed c>0c > 0,

Consider xk(c)x_k(c) is strictly increasing, because of x1(c)=c−1>−1x_1(c) = c-1 > -1 and xk+1(c)=P(xk(c))x_{k+1}(c) = P(x_k(c)). The equation xt−1(c)=0x_{t-1}(c) = 0 (where cc is the unknown). Since the leading coefficient of the polynomial xt−1(c)x_{t-1}(c) equals 11 and the constant term is −1-1 (we can prove these claims trivially by induction on tt), this polynomial has a positive zero. Let c0c_0 be one of them. Now for the polynomial P(x)=(x+1)s+c0−1P(x) = (x+1)^s + c_0 - 1 we have xt−1(c0)=0x_{t-1}(c_0) = 0, and therefore xt(c0)=P(0)=c0>0x_t(c_0) = P(0) = c_0 > 0. This completes the proof. □\square

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.