Olympiad Maths Prep

Track / Stage 6 / 186 of 400 #1186 of 2000

Problem 1186

National olympiad, first round
Algebra Difficulty 6.3 Prove it

4. Let a3,p(x)a \geqslant 3, p(x) be a polynomial with real coefficients, degp(x)=n\operatorname{deg} p(x)=n, prove that: max0in+1aip(i)1\max _{0 \leqslant i \leqslant n+1}\left|a^{i}-p(i)\right| \geqslant 1.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

4. Since the problem involves the values of the function f(x)=axp(x)f(x)=a^{x}-p(x) at n+2n+2 consecutive integers x=0,1,,n+1x=0,1, \cdots, n+1, we hope to estimate f(x)f(x) using the difference formula to solve this problem. In fact, by definition, we have
Δax=ax+1ax=(a1)ax,Δ2ax=(a1)Δax=(a1)2ax,Δn1ax=(a1)n+1ax. \begin{array}{l} \Delta a^{x}=a^{x+1}-a^{x}=(a-1) a^{x}, \\ \Delta^{2} a^{x}=(a-1) \Delta a^{x}=(a-1)^{2} a^{x}, \\ \cdots \\ \Delta^{n-1} a^{x}=(a-1)^{n+1} a^{x} . \end{array}

Thus, Δn1axx=0=(a1)n+1\left.\Delta^{n-1} a^{x}\right|_{x=0}=(a-1)^{n+1}. Therefore, by the theorem, we have
Δn+1f(0)=k=0n1(1)n+1kCn+1k[akp(k)]. \Delta^{n+1} f(0)=\sum_{k=0}^{n-1}(-1)^{n+1-k} C_{n+1}^{k}\left[a^{k}-p(k)\right] .

Also, Δn+1f(0)=Δn+1axx=0Δn1p(0)=(a1)n+1\Delta^{n+1} f(0)=\left.\Delta^{n+1} a^{x}\right|_{x=0}-\Delta^{n-1} p(0)=(a-1)^{n+1}, so
(a1)n+1=k=0n+1(1)n1kCn+1k[akp(k)]. (a-1)^{n+1}=\sum_{k=0}^{n+1}(-1)^{n-1-k} C_{n+1}^{k}\left[a^{k}-p(k)\right] .

Assume for contradiction that max0im1{aip(i)}<1\max _{0 \leqslant i \leqslant m-1}\left\{\left|a^{i}-p(i)\right|\right\}<1, i.e., for all i=0,1,,n+1,aip(i)<1i=0,1, \cdots, n+1,\left|a^{i}-p(i)\right|<1. Thus, by a3a \geqslant 3, we get 2n+1(a1)n+1<k=0n+1Cn+1=2n12^{n+1} \leqslant(a-1)^{n+1}<\sum_{k=0}^{n+1} C_{n+1}^{*}=2^{n-1}. This is a contradiction. Therefore, max0in+1aip(i)1\max _{0 \leqslant i \leqslant n+1}\left|a^{i}-p(i)\right| \geqslant 1.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.