Maths Olympiad Prep

Library / Mongolian Mathematical Olympiad /47 of 97

Mongolian Mathematical Olympiad

Algebra Difficulty 6.0 AIME, harder Prove it Mongolia

Find all continuous functions f:R→Rf : \mathbb{R} \to \mathbb{R} that satisfy conditions:
f(0)=0f(0) = 0 and ∀x∈R:f(2x)≥x+f(x)\forall x \in \mathbb{R}: f(2x) \geq x + f(x), f(3x)≤2x+f(x)f(3x) \leq 2x + f(x).

Solution

Substitute g(x)=f(x)−xg(x) = f(x) - x, x∈Rx \in \mathbb{R}. Considering the given conditions we get f(2x)=g(2x)+2x≥g(x)+2x⇔g(2x)≥g(x)f(2x) = g(2x) + 2x \geq g(x) + 2x \Leftrightarrow g(2x) \geq g(x) and f(3x)=g(3x)+3x≤g(x)+3x⇔g(3x)≤g(x)f(3x) = g(3x) + 3x \leq g(x) + 3x \Leftrightarrow g(3x) \leq g(x). In other words, ∀x∈R:g(3x)≤g(x)≤g(2x)\forall x \in \mathbb{R}: g(3x) \leq g(x) \leq g(2x).

Let us consider ∀a>0\forall a > 0 and let m=min⁡x∈[−a,a]g(x)m = \min_{x \in [-a,a]} g(x) and M=max⁡x∈[−a,a]g(x)M = \max_{x \in [-a,a]} g(x). By Weierstrass theorem there exists x0∈[−a,a]x_0 \in [-a, a] such that g(x0)=Mg(x_0) = M.

Now define a sequence as follows: xn=3−nx0x_n = 3^{-n} x_0, n=1,2,…n = 1, 2, \dots. Consequently we get ∀x∈R:g(3x)≤g(x)⇒g(xn)≤g(xn+1),∀n∈N\forall x \in \mathbb{R}: g(3x) \leq g(x) \Rightarrow g(x_n) \leq g(x_{n+1}), \forall n \in \mathbb{N}. From this follows g(xn)≥g(x0)=M,∀n∈Ng(x_n) \geq g(x_0) = M, \forall n \in \mathbb{N} and xn∈[−a,a],∀n∈N⇒g(xn)≤Mx_n \in [-a, a], \forall n \in \mathbb{N} \Rightarrow g(x_n) \leq M and ∀n∈N:g(xn)=M\forall n \in \mathbb{N}: g(x_n) = M.

Since g(x)g(x) is a continuous function, lim⁡n→∞(g(xn))=g(lim⁡n→∞xn)=g(0)=0=M⇒∀x∈[−a,a]:g(x)≤0\lim_{n \to \infty} (g(x_n)) = g(\lim_{n \to \infty} x_n) = g(0) = 0 = M \Rightarrow \forall x \in [-a, a] : g(x) \leq 0. Similarly we get g(2x)≥g(x),∀x∈R⇒g(x)≥0,x∈[−a,a]g(2x) \geq g(x), \forall x \in \mathbb{R} \Rightarrow g(x) \geq 0, x \in [-a, a]. Therefore ∀x∈[−a,a]:g(x)≡0\forall x \in [-a, a] : g(x) \equiv 0. It implies ∀x∈R:g(x)≡0\forall x \in \mathbb{R} : g(x) \equiv 0 and f(x)=xf(x) = x.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.