uniolympiads Ελληνικά

IMC 2017, Day 2, Problem 7

Let p(x)p(x) be a nonconstant polynomial with real coefficients. For every positive integer nn, let

qn(x)=(x+1)np(x)+xnp(x+1).q_n(x) = (x+1)^n p(x) + x^n p(x+1).

Prove that there are only finitely many numbers nn such that all roots of qn(x)q_n(x) are real.

Original from the official PDFinteger n , let Let p(x) be a nonconstant polynomial with real coecients. For every positive q n (x) = (x + 1) n p(x) + x n p(x + 1). Prove that there are only nitely many numbers n such that all roots of q n (x) are real.

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 Alexandr Bolbot, Novosibirsk State University)

Solution.

Lemma. If f(x)=amxm+…+a1x+a0f(x) = a_m x^m + \ldots + a_1 x + a_0 is a polynomial with am≠0a_m\ne 0, and all roots of ff are real, then

am−12−2amam−2≥0.a_{m-1}^2 - 2a_m a_{m-2} \ge 0.

Proof. Let the roots of ff be w1,…,wnw_1,\ldots,w_n. By the Viéte-formulas,

∑i=1mwi=−am−1am,∑i<jwiwj=am−2am,\sum_{i=1}^m w_i = -\frac{a_{m-1}}{a_m}, \qquad \sum_{i<j} w_i w_j = \frac{a_{m-2}}{a_m},
0≤∑i=1mwi2=(∑i=1mwi)2−2∑i<jwiwj=(am−1am)2−2am−2am=am−12−2amam−2am2.0 \le \sum_{i=1}^m w_i^2 = \left(\sum_{i=1}^m w_i\right)^2 - 2\sum_{i<j} w_i w_j = \left(\frac{a_{m-1}}{a_m}\right)^2 - 2\frac{a_{m-2}}{a_m} = \frac{a_{m-1}^2 - 2a_m a_{m-2}}{a_m^2}.

In view of the Lemma we focus on the asymptotic behavior of the three terms in qn(x)q_n(x) with the highest degrees. Let p(x)=axk+bxk−1+cxk−2+…p(x) = ax^k + bx^{k-1} + cx^{k-2} + \ldots and qn(x)=Anxn+k+Bnxn+k−1+Cnxn+k−2+…q_n(x) = A_n x^{n+k} + B_n x^{n+k-1} + C_n x^{n+k-2} + \ldots; then

qn(x)=(x+1)np(x)+xnp(x+1)==(xn+nxn−1+n(n−1)2xn−2+…)(axk+bxk−1+cxk−2+…)+xn(a(xk+kxk−1+k(k−1)2xk−2+…)+b(xk−1+(k−1)xk−2+…)+c(xk−2…)+…)=2a⋅xn+k+((n+k)a+2b)xn+k−1+(n(n−1)+k(k−1)2a+(n+k−1)b+2c)xn+k−2+…,\begin{aligned} q_n(x) &= (x+1)^n p(x) + x^n p(x+1) = \\ &= \left(x^n + nx^{n-1} + \frac{n(n-1)}{2}x^{n-2} + \ldots\right)(ax^k + bx^{k-1} + cx^{k-2} + \ldots) \\ &\quad + x^n\Bigg(a\left(x^k + kx^{k-1} + \frac{k(k-1)}{2}x^{k-2} + \ldots\right) \\ &\qquad\qquad + b\Big(x^{k-1} + (k-1)x^{k-2} + \ldots\Big) + c\Big(x^{k-2}\ldots\Big) + \ldots\Bigg) \\ &= 2a\cdot x^{n+k} + \big((n+k)a + 2b\big)x^{n+k-1} \\ &\qquad + \left(\frac{n(n-1)+k(k-1)}{2}a + (n+k-1)b + 2c\right)x^{n+k-2} + \ldots, \end{aligned}
so
An=2a,Bn=(n+k)a+2b=Cn=n(n−1)+k(k−1)2a+(n+k−1)b+2c.A_n = 2a, \quad B_n = (n+k)a + 2b = \quad C_n = \frac{n(n-1)+k(k-1)}{2}a + (n+k-1)b + 2c.
If n→∞n\to\infty then
Bn2−2AnCn=(na+O(1))2−2⋅2a(n2a2+O(n))=−an2+O(n)→−∞,B_n^2 - 2A_nC_n = \big(na + O(1)\big)^2 - 2\cdot 2a\left(\frac{n^2a}{2} + O(n)\right) = -an^2 + O(n) \to -\infty,
so Bn2−2AnCnB_n^2 - 2A_nC_n is eventually negative, indicating that qnq_n cannot have only real roots.

Transcribed from the official solutions, pages 2–3. 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?