Maths Olympiad Prep

Library / /92 of 155

Algebra Difficulty 6.3 National olympiad Prove it Saudi Arabia

Let R+\mathbb{R}^{+} be the set of positive real numbers. Find all function f:R+Rf: \mathbb{R}^{+} \rightarrow \mathbb{R} such that, for all positive real number xx and yy, the following conditions are satisfied:
i) 2f(x)+2f(y)f(x+y)2 f(x)+2 f(y) \leq f(x+y).
ii) (x+y)[yf(x)+xf(y)]xyf(x+y)(x+y)[y f(x)+x f(y)] \geq x y f(x+y).

Solution

Replacing x=yx = y in i) and ii), we get f(2x)=4f(x)f(2x) = 4 f(x), xR+\forall x \in \mathbb{R}^{+}. Therefore, by induction, we can prove that
f(2nx)=4nf(x),nZ+,xR+. f\left(2^{n} x\right) = 4^{n} f(x), \quad \forall n \in \mathbb{Z}^{+}, x \in \mathbb{R}^{+}.
Now, by substituting y=2xy = 2x in i) and ii), we get 10f(x)f(3x)9f(x)10 f(x) \leq f(3x) \leq 9 f(x), xR+\forall x \in \mathbb{R}^{+}. It follows that f(x)0,xR+f(x) \leq 0, \forall x \in \mathbb{R}^{+}. Therefore, from ii), we have
xyf(x+y)(x+y)yf(x)xyf(x), x y f(x+y) \leq (x+y) y f(x) \leq x y f(x),
or
f(x+y)f(x),x,yR+. f(x+y) \leq f(x), \quad \forall x, y \in \mathbb{R}^{+}.
Next, we rewrite the condition ii) as
f(x+y)x+yf(x)x+f(y)y. \frac{f(x+y)}{x+y} \leq \frac{f(x)}{x} + \frac{f(y)}{y}.
By substituting y=2x,3x,,nx(nZ+)y = 2x, 3x, \ldots, n x\left(n \in \mathbb{Z}^{+}\right), we can prove by induction that
f(nx)n2f(x),nZ+,xR+.(*) f(n x) \leq n^{2} f(x), \quad \forall n \in \mathbb{Z}^{+}, x \in \mathbb{R}^{+}. \tag{*}
From these inequalities, we get
2nf(x)x=f(2nx)2nx=f((2nn)x+nx)(2nn)x+nxf((2nn)x)(2nn)x+f(nx)nx(2nn)f(x)x+nf(x)x=2nf(x)x \begin{aligned} \frac{2^{n} f(x)}{x} &= \frac{f\left(2^{n} x\right)}{2^{n} x} = \frac{f\left(\left(2^{n} - n\right) x + n x\right)}{\left(2^{n} - n\right) x + n x} \\ &\leq \frac{f\left(\left(2^{n} - n\right) x\right)}{\left(2^{n} - n\right) x} + \frac{f(n x)}{n x} \\ &\leq \frac{\left(2^{n} - n\right) f(x)}{x} + \frac{n f(x)}{x} = \frac{2^{n} f(x)}{x} \end{aligned}
for any positive integer nn and any positive real number xx. Therefore, the equality cases in (*) must hold, i.e.
f(nx)=n2f(x),nZ+,xR+. f(n x) = n^{2} f(x), \quad \forall n \in \mathbb{Z}^{+}, x \in \mathbb{R}^{+}.
From this, we can easily prove that f(x)=kx2,xQ+f(x) = k x^{2}, \forall x \in \mathbb{Q}^{+} (where k=f(1)k = f(1), and k0k \leq 0). And then, by combining this result with f(x+y)f(x),x,y>0f(x+y) \leq f(x), \forall x, y > 0, we conclude that f(x)=kx2,xR+f(x) = k x^{2}, \forall x \in \mathbb{R}^{+}.
It is easy to check that this function satisfy the given conditions.

Want a route through all this instead of 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.