uniolympiads Ελληνικά

IMC 2006, Day 1, Problem 6

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

If f ⁣:R→Rf\colon \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_0f(h) + a_1f'(h) + \dots + a_nf^{(n)}(h) = 0.
Original from the official PDFFind all sequences a 0 , a 1 , . . . , a n of real numbers where n ≥ 1 and a n 6 = 0, for which the following statement is true: If f : R → R is an n times differentiable function and x 0 < x 1 < . . . < x n are real numbers such that f (x 0 ) = f (x 1 ) = . . . = f (x n ) = 0 then there exists an h ∈ (x 0 , x n ) for which a 0 f (h) + a 1 f 0 (h) + . . . + a n f (n) (h) = 0. (20 points)

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

Solution. Let A(x)=a0+a1x+…+anxnA(x)=a_0+a_1x+\ldots+a_nx^n. We prove that sequence a0,…,ana_0,\ldots,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 R→R\mathbb{R}\to\mathbb{R} functions and DD be differentiation operator. For an arbitrary polynomial P(x)=p0+p1x+…+pnxnP(x)=p_0+p_1x+\ldots+p_nx^n, write P(D)=p0I+p1D+p2D2+…+pnDnP(D)=p_0I+p_1D+p_2D^2+\ldots+p_nD^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′(ξ)=a0a1ea0a1ξf(ξ)+ea0a1ξf′ξ)=ea0a1ξa1(a0f(ξ)+a1f′(ξ))=0.g'(\xi)=\frac{a_0}{a_1}e^{\frac{a_0}{a_1}\xi}f(\xi)+e^{\frac{a_0}{a_1}\xi}f'\xi)=\frac{e^{\frac{a_0}{a_1}\xi}}{a_1}\big(a_0f(\xi)+a_1f'(\xi)\big)=0.
Now assume that n>1n>1 and the statement holds for n−1n-1. Let A(x)=(x−c)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), …\ldots, yn−1∈(xn−1,xn)y_{n-1}\in(x_{n-1},x_n) such that f′(yj)−cf(yj)=0f'(y_j)-cf(y_j)=0 for all j=0,1,…,n−1j=0,1,\ldots,n-1. Now apply the induction hypothesis for polynomial B(x)B(x), function g=f′−cfg=f'-cf and points y0,…,yn−1y_0,\ldots,y_{n-1}. The hypothesis says that there exists a ξ∈(y0,yn−1)⊂(x0,xn)\xi\in(y_0,y_{n-1})\subset(x_0,x_n) such that
(B(D)g)(ξ)=(B(D)(D−cI)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 v≠0v\ne0. Consider the linear differential equation ang(n)+…+a1g′+g=0a_ng^{(n)}+\ldots+a_1g'+g=0. A solution of this equation is g1(x)=euxsin⁡vxg_1(x)=e^{ux}\sin vx which has infinitely many zeros.

Let kk be the smallest index for which ak≠0a_k\ne0. 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_0f+a_1f'+\ldots+a_nf^{(n)}=a_k\varepsilon\ne0 everywhere.

Transcribed from the official solutions, page 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?