Maths Olympiad Prep

Library / /221 of 397

, 2022

Algebra Difficulty 6.0 National Olympiad Prove it Taiwan

Let R+\mathbb{R}^+ be the set of all positive real numbers. Find all functions f:R+R+f: \mathbb{R}^+ \to \mathbb{R}^+ such that
f(x+y2f(y))=f(1+yf(x))f(x) f(x + y^2 f(y)) = f(1 + y f(x)) f(x)
holds for all positive real numbers x,yx, y.

Solution

Let P(x,y)P(x, y) denote substituting (x,y)(x, y) into the given condition.
P(1,1)f(1)=1. P(1, 1) \Rightarrow f(1) = 1.
P(1,y)f(1+y2f(y))=f(1+y).(1) P(1, y) \Rightarrow f(1 + y^2 f(y)) = f(1 + y). \qquad (1)
P(x,1)f(x+1)=f(1+f(x))f(x).(2) P(x, 1) \Rightarrow f(x + 1) = f(1 + f(x)) f(x). \qquad (2)
Comparing P(1+x2f(x),y)P(1 + x^2 f(x), y) and P(1+y2f(y),x)P(1 + y^2 f(y), x), we have
f(1+x2f(x)+y2f(y))=f(1+yf(1+x2f(x)))f(1+x2f(x))=f(1+yf(1+x))f(1+x)(3)=f(1+xf(1+y))f(1+y). \begin{aligned} f(1 + x^2 f(x) + y^2 f(y)) &= f(1 + y f(1 + x^2 f(x))) f(1 + x^2 f(x)) \\ &= f(1 + y f(1 + x)) f(1 + x) \qquad (3) \\ &= f(1 + x f(1 + y)) f(1 + y). \end{aligned}
Therefore, consider another function g:R>1R+g : \mathbb{R}_{>-1} \to \mathbb{R}^+ satisfying g(x)=f(1+x)g(x) = f(1 + x) for all x>1x > -1. Then equation (3) can be rewritten as
g(yg(x))g(x)=g(xg(y))g(y).(4) g(y g(x)) g(x) = g(x g(y)) g(y). \qquad (4)
Consider P(1+x,y)P(1 + x, y) together with equation (4), we have
P(1+x,y)f(1+x+y2f(y))=f(1+yf(1+x))f(1+x)(5)g(x+y2g(y1))=g(yg(x))g(x)=g(xg(y))g(y). \begin{aligned} P(1 + x, y) &\Rightarrow f(1 + x + y^2 f(y)) = f(1 + y f(1 + x)) f(1 + x) \qquad (5) \\ &\Rightarrow g(x + y^2 g(y - 1)) = g(y g(x)) g(x) = g(x g(y)) g(y). \end{aligned}
Suppose there exist two distinct positive real numbers a,ba, b satisfying f(a)=f(b)f(a) = f(b). From equation (2) we can deduce
f(a+1)=f(1+f(a))f(a)=f(1+f(b))f(b)=f(b+1). f(a + 1) = f(1 + f(a)) f(a) = f(1 + f(b)) f(b) = f(b + 1).
Note that
g(a)=f(a+1)=f(b+1)=g(b)(a+1)2g(a)(b+1)2g(b). g(a) = f(a + 1) = f(b + 1) = g(b) \Rightarrow (a + 1)^2 g(a) \neq (b + 1)^2 g(b).
g(x+(a+1)2g(a))=g(xg(a+1))g(a+1)=g(xg(b+1))g(b+1)=g(x+(b+1)2g(b)). g(x + (a + 1)^2 g(a)) = g(x g(a + 1)) g(a + 1) = g(x g(b + 1)) g(b + 1) = g(x + (b + 1)^2 g(b)).
Let c=(b+1)2g(b)(a+1)2g(a)>0c = |(b + 1)^2 g(b) - (a + 1)^2 g(a)| > 0 and M=max{(a+1)2g(a),(b+1)2g(b)}M = \max\{(a + 1)^2 g(a), (b + 1)^2 g(b)\}, then the above equation can be rewritten as
g(x+c)=g(x)x>M. g(x + c) = g(x) \quad \forall x > M.
For y>1y > -1, if g(y)1g(y) \neq 1, choose x0>Mg(y)x_0 > \frac{M}{g(y)} satisfying x0+y2g(y1)=x0g(y)+mc>Mx_0 + y^2 g(y - 1) = x_0 g(y) + m c > M for some mZm \in \mathbb{Z}, and substitute (x,y)=(x0,y)(x, y) = (x_0, y) into equation (5),
g(x0+y2g(y1))=g(x0g(y))g(y)g(y)=1. g(x_0 + y^2 g(y - 1)) = g(x_0 g(y)) g(y) \Rightarrow g(y) = 1.
Therefore, f(y)=1f(y) = 1 for all y>0y > 0.

If there do not exist two distinct positive real numbers a,ba, b satisfying f(a)=f(b)f(a) = f(b), then equation (1) implies
1+y2f(y)=1+yf(y)=1y,y>0. 1 + y^2 f(y) = 1 + y \Rightarrow f(y) = \frac{1}{y}, \forall y > 0.
Substituting back into the original equation to verify, we find that both f(y)1f(y) \equiv 1 and f(y)=1yf(y) = \frac{1}{y} are solutions of the original equation.

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 translated into English from zh; metadata (topic, difficulty) added by this project.