uniolympiads Ελληνικά

IMC 2015, Day 2, Problem 10

Let nn be a positive integer, and let p(x)p(x) be a polynomial of degree nn with integer coefficients. Prove that

max⁡0≤x≤1∣p(x)∣>1en.\max_{0 \le x \le 1} |p(x)| > \frac{1}{e^n}.
Original from the official PDFLet n be a positive integer, and let p(x) be a polynomial of degree n with integer coecients. Prove that Problem 10. max p(x) > 0≤x≤1 1 . e n

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

(Proposed by Géza Kós, Eötvös University, Budapest)

Solution. Let

M=max⁡0≤x≤1∣p(x)∣.M = \max_{0\le x\le 1}\big|p(x)\big|.

For every positive integer kk, let

Jk=∫01(p(x))2k dx.J_k = \int_0^1\big(p(x)\big)^{2k}\,\mathrm{d}x.
Obviously 0<Jk<M2k0<J_k<M^{2k} is a rational number. If (p(x))2k=∑i=02knak,ixi(p(x))^{2k} = \sum\limits_{i=0}^{2kn}a_{k,i}x^i then Jk=∑i=02knak,ii+1J_k = \sum\limits_{i=0}^{2kn}\frac{a_{k,i}}{i+1}. Taking the least common denominator, we can see that Jk≥1lcm(1,2,…,2kn+1)J_k\ge\dfrac{1}{\mathrm{lcm}(1,2,\ldots,2kn+1)}.

An equivalent form of the prime number theorem is that log⁡lcm(1,2,…,N)∼N\log\mathrm{lcm}(1,2,\ldots,N)\sim N if N→∞N\to\infty. Therefore, for every ε>0\varepsilon>0 and sufficiently large kk we have

lcm(1,2,…,2kn+1)<e(1+ε)(2kn+1)\mathrm{lcm}(1,2,\ldots,2kn+1) < e^{(1+\varepsilon)(2kn+1)}
and therefore
M2k>Jk≥1lcm(1,2,…,2kn+1)>1e(1+ε)(2kn+1),M>1e(1+ε)(n+12k).\begin{gathered} M^{2k} > J_k \ge \frac{1}{\mathrm{lcm}(1,2,\ldots,2kn+1)} > \frac{1}{e^{(1+\varepsilon)(2kn+1)}}, \\ M > \frac{1}{e^{(1+\varepsilon)(n+\frac{1}{2k})}}. \end{gathered}
Taking k→∞k\to\infty and then ε→+0\varepsilon\to+0 we get
M≥1en.M\ge\frac{1}{e^n}.
Since ee is transcendent, equality is impossible.

Remark. The constant 1e≈0.3679\frac{1}{e}\approx 0.3679 is not sharp. It is known that the best constant is between 0.4213 and 0.4232. (See I. E. Pritsker, The Gelfond–Schnirelman method in prime number theory, Canad. J. Math. 57 (2005), 1080–1101.)

Transcribed from the official solutions, page 4. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?