Olympiad Maths Prep

Library / /25 of 41

Algebra Difficulty 5.7 AIME, harder Prove it Romania

Find all functions f:RRf : \mathbb{R} \to \mathbb{R} such that
f(a2)f(b2)(f(a)+b)(af(b)),for all a,bR. f(a^2) - f(b^2) \leq (f(a) + b)(a - f(b)), \quad \text{for all } a, b \in \mathbb{R}.

Solution

Plugging a=b=0a = b = 0 yields f2(0)0f^2(0) \leq 0, hence f(0)=0f(0) = 0. Again, plugging b=0b = 0, and then a=0a = 0, we obtain f(a2)af(a)f(a^2) \leq af(a), aR\forall a \in \mathbb{R} and f(b2)bf(b)f(b^2) \geq bf(b), bR\forall b \in \mathbb{R}, therefore f(x2)=xf(x)f(x^2) = xf(x), xR\forall x \in \mathbb{R}. Replacing the latter in the given equation, we get f(a)f(b)abf(a)f(b) \leq ab, a,bR\forall a, b \in \mathbb{R}.
Also, xf(x)=f((x)2)=f(x2)=xf(x)-xf(-x) = f((-x)^2) = f(x^2) = xf(x), hence ff is an odd function.
The last two relations give f(a)f(b)=f(a)f(b)(ab)=abf(a)f(b) = -f(a)f(-b) \geq -(-ab) = ab, so f(a)f(b)=abf(a)f(b) = ab, a,bR\forall a, b \in \mathbb{R}.
Thus, f2(1)=1f^2(1) = 1, which implies f(1)=±1f(1) = \pm 1 and either f(x)=x,xRf(x) = x, \forall x \in \mathbb{R}, or f(x)=x,xRf(x) = -x, \forall x \in \mathbb{R}.

It is easy to check that both functions are solutions of the problem.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.