Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2006 / Problems / Day 1, P6

IMC 2006 · Day 1 · P6

killer

Find all sequences a0,a1,,ana_0, a_1, \dots, a_n of real numbers where n1n \ge 1 and an0a_n \ne 0, for which the following statement is true:

If f:RRf : \mathbb{R} \to \mathbb{R} is an nn times differentiable function and x0<x1<<xnx_0 < x_1 < \dots < x_n are real numbers such that f(x0)=f(x1)==f(xn)=0f(x_0) = f(x_1) = \dots = f(x_n) = 0 then there exists an h(x0,xn)h \in (x_0, x_n) for which a0f(h)+a1f(h)++anf(n)(h)=0.a_0 f(h) + a_1 f'(h) + \dots + a_n f^{(n)}(h) = 0.

Solution (official)

Let A(x)=a0+a1x++anxnA(x) = a_0 + a_1 x + \dots + a_n x^n. We prove that sequence a0,,ana_0, \dots, a_n satisfies the required property if and only if all zeros of polynomial A(x)A(x) are real.

(a) Assume that all roots of A(x)A(x) are real. Let us use the following notations. Let II be the identity operator on RR\mathbb{R} \to \mathbb{R} functions and DD be differentiation operator. For an arbitrary polynomial P(x)=p0+p1x++pnxnP(x) = p_0 + p_1 x + \dots + p_n x^n, write P(D)=p0I+p1D+p2D2++pnDnP(D) = p_0 I + p_1 D + p_2 D^2 + \dots + p_n D^n. Then the statement can written as (A(D)f)(ξ)=0(A(D) f)(\xi) = 0.

First prove the statement for n=1n = 1. Consider the function g(x)=ea0a1xf(x).g(x) = e^{\frac{a_0}{a_1} x} f(x). Since g(x0)=g(x1)=0g(x_0) = g(x_1) = 0, by Rolle's theorem there exists a ξ(x0,x1)\xi \in (x_0, x_1) for which g(ξ)=ea0a1ξa0a1f(ξ)+ea0a1ξf(ξ)=ea0a1ξa1(a0f(ξ)+a1f(ξ))=0.g'(\xi) = e^{\frac{a_0}{a_1} \xi} \frac{a_0}{a_1} f(\xi) + e^{\frac{a_0}{a_1} \xi} f'(\xi) = \frac{e^{\frac{a_0}{a_1} \xi}}{a_1} (a_0 f(\xi) + a_1 f'(\xi)) = 0. Now assume that n>1n > 1 and the statement holds for n1n-1. Let A(x)=(xc)B(x)A(x) = (x - c) B(x) where cc is a real root of polynomial AA. By the n=1n = 1 case, there exist y0(x0,x1)y_0 \in (x_0, x_1), y1(x1,x2)y_1 \in (x_1, x_2), …, yn1(xn1,xn)y_{n-1} \in (x_{n-1}, x_n) such that f(yj)cf(yj)=0f'(y_j) - c f(y_j) = 0 for all j=0,1,,n1j = 0, 1, \dots, n-1. Now apply the induction hypothesis for polynomial B(x)B(x), function g=fcfg = f' - cf and points y0,,yn1y_0, \dots, y_{n-1}. The hypothesis says that there exists a ξ(y0,yn1)(x0,xn)\xi \in (y_0, y_{n-1}) \subset (x_0, x_n) such that (B(D)g)(ξ)=(B(D)(DcI)f)(ξ)=(A(D)f)(ξ)=0.(B(D) g)(\xi) = (B(D)(D - cI) f)(\xi) = (A(D) f)(\xi) = 0.

(b) Assume that u+viu + vi is a complex root of polynomial A(x)A(x) such that v0v \ne 0. Consider the linear differential equation ang(n)++a1g+g=0a_n g^{(n)} + \dots + a_1 g' + g = 0.

A solution of this equation is g1(x)=euxsinvxg_1(x) = e^{ux} \sin vx which has infinitely many zeros.

Let kk be the smallest index for which ak0a_k \ne 0. Choose a small ε>0\varepsilon > 0 and set f(x)=g1(x)+εxkf(x) = g_1(x) + \varepsilon x^k. If ε\varepsilon is sufficiently small then gg has the required number of roots but a0f+a1f++anf(n)=akε0a_0 f + a_1 f' + \dots + a_n f^{(n)} = a_k \varepsilon \ne 0

everywhere.

How the field did

contestants scored
237
average (of 20)
0.65
solved (≥ 80%)
0.8%
near-0 (≤ 10%)
94.9%
discrimination
0.18

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2007 · Day 2 · P12killeravg 0.1/10 · solved 0% · near-0 99% · disc 0.36
IMC 2017 · Day 2 · P7very hardavg 1.6/10 · solved 14% · near-0 83% · disc 0.44
IMC 2014 · Day 1 · P3mediumavg 4.2/10 · solved 40% · near-0 54% · disc 0.53