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

IMC / 2010 / Problems / Day 2, P10

IMC 2010 · Day 2 · P10

killer

Suppose that for a function f:RRf : \mathbb{R} \to \mathbb{R} and real numbers a<ba < b one has f(x)=0f(x) = 0 for all x(a,b)x \in (a, b). Prove that f(x)=0f(x) = 0 for all xRx \in \mathbb{R} if k=0p1f(y+kp)=0\sum_{k=0}^{p-1} f \left( y + \frac{k}{p} \right) = 0 for every prime number pp and every real number yy.

Solution (official)

Let N>1N > 1 be some integer to be defined later, and consider set of

real polynomials JN={c0+c1x++cnxnR[x] | xR k=0nckf(x+kN)=0}.J_N = \left\{ c_0 + c_1 x + \dots + c_n x^n \in \mathbb{R}[x] \ \middle|\ \forall x \in \mathbb{R}\ \sum_{k=0}^{n} c_k f \left( x + \frac{k}{N} \right) = 0 \right\}. Notice that 0JN0 \in J_N, any linear combinations of any elements in JNJ_N is in JNJ_N, and for every P(x)JNP(x) \in J_N we have xP(x)JNx P(x) \in J_N. Hence, JNJ_N is an ideal of the ring R[x]\mathbb{R}[x].

By the problem's conditions, for every prime divisors pp of NN we have xN1xN/p1JN\dfrac{x^N - 1}{x^{N/p} - 1} \in J_N. Since R[x]\mathbb{R}[x] is a principal ideal domain (due to the Euclidean algorithm), the greatest common divisor of these polynomials is an element of JNJ_N. The complex roots of the polynomial xN1xN/p1\dfrac{x^N - 1}{x^{N/p} - 1} are those NNth roots of unity whose order does not divide N/pN/p. The roots of the greatest common divisor is the intersection of such sets; it can be seen that the intersection consist of the primitive NNth roots of unity. Therefore, gcd{xN1xN/p1 | pN}=ΦN(x)\gcd \left\{ \frac{x^N - 1}{x^{N/p} - 1}\ \middle|\ p \mid N \right\} = \Phi_N(x) is the NNth cyclotomic polynomial. So ΦNJN\Phi_N \in J_N, which polynomial has degree φ(N)\varphi(N).

Now choose NN in such a way that φ(N)N<ba\dfrac{\varphi(N)}{N} < b - a. It is well-known that lim infNφ(N)N=0\liminf\limits_{N \to \infty} \dfrac{\varphi(N)}{N} = 0, so there exists such a value for NN. Let ΦN(x)=a0+a1x++aφ(N)xφ(N)\Phi_N(x) = a_0 + a_1 x + \dots + a_{\varphi(N)} x^{\varphi(N)} where aφ(N)=1a_{\varphi(N)} = 1 and a0=1|a_0| = 1. Then, by the definition of JNJ_N, we have k=0φ(N)akf(x+kN)=0\sum\limits_{k=0}^{\varphi(N)} a_k f \left( x + \frac{k}{N} \right) = 0 for all xRx \in \mathbb{R}.

If x[b,b+1N)x \in \left[ b, b + \frac{1}{N} \right), then f(x)=k=0φ(N)1akf(xφ(N)kN).f(x) = -\sum_{k=0}^{\varphi(N)-1} a_k f \left( x - \frac{\varphi(N) - k}{N} \right). On the right-hand side, all numbers xφ(N)kNx - \frac{\varphi(N) - k}{N} lie in (a,b)(a, b). Therefore the right-hand side is zero, and f(x)=0f(x) = 0 for all x[b,b+1N)x \in \left[ b, b + \frac{1}{N} \right). It can be obtained similarly that f(x)=0f(x) = 0 for all x(a1N,a]x \in \left( a - \frac{1}{N}, a \right] as well. Hence, f=0f = 0 in the interval (a1N,b+1N)\left( a - \frac{1}{N}, b + \frac{1}{N} \right). Continuing in this fashion we see that ff must vanish everywhere.

How the field did

contestants scored
322
average (of 10)
0.08
solved (≥ 80%)
0.6%
near-0 (≤ 10%)
99.4%
discrimination
0.24

Score distribution (field cohort)

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

Similar problems

IMC 2023 · Day 2 · P10killeravg 0.2/10 · solved 1% · near-0 98% · disc 0.24
IMC 2025 · Day 2 · P10killeravg 0.2/10 · solved 1% · near-0 96% · disc 0.32
IMC 2018 · Day 2 · P10killeravg 0.3/10 · solved 1% · near-0 96% · disc 0.37
IMC 2012 · Day 1 · P5killeravg 0.5/10 · solved 2% · near-0 91% · disc 0.28