Olympiad Maths Prep

Library / /10 of 13

Algebra Difficulty 8.8 Shortlist Prove it IMO

Denote by Q+\mathbb{Q}^{+} the set of all positive rational numbers. Determine all functions f:Q+Q+f: \mathbb{Q}^{+} \rightarrow \mathbb{Q}^{+} which satisfy the following equation for all x,yQ+x, y \in \mathbb{Q}^{+}:
f(f(x)2y)=x3f(xy) f\left(f(x)^{2} y\right)=x^{3} f(x y)

Solution

By substituting y=1y=1, we get
f(f(x)2)=x3f(x) f\left(f(x)^{2}\right)=x^{3} f(x)
Then, whenever f(x)=f(y)f(x)=f(y), we have
x3=f(f(x)2)f(x)=f(f(y)2)f(y)=y3 x^{3}=\frac{f\left(f(x)^{2}\right)}{f(x)}=\frac{f\left(f(y)^{2}\right)}{f(y)}=y^{3}
which implies x=yx=y, so the function ff is injective.

Now replace xx by xyx y in the previous equation, and apply the original equation twice, the second time to (y,f(x)2)(y, f(x)^{2}) instead of (x,y)(x, y):
f(f(xy)2)=(xy)3f(xy)=y3f(f(x)2y)=f(f(x)2f(y)2) f\left(f(x y)^{2}\right)=(x y)^{3} f(x y)=y^{3} f\left(f(x)^{2} y\right)=f\left(f(x)^{2} f(y)^{2}\right)
Since ff is injective, we get
f(xy)2=f(x)2f(y)2f(xy)=f(x)f(y) \begin{aligned} f(x y)^{2} & =f(x)^{2} f(y)^{2} \\ f(x y) & =f(x) f(y) \end{aligned}
Therefore, ff is multiplicative. This also implies f(1)=1f(1)=1 and f(xn)=f(x)nf\left(x^{n}\right)=f(x)^{n} for all integers nn.

Then the functional equation can be re-written as
f(f(x))2f(y)=x3f(x)f(y),f(f(x))=x3f(x) \begin{align*} f(f(x))^{2} f(y) & =x^{3} f(x) f(y), \\ f(f(x)) & =\sqrt{x^{3} f(x)} \end{align*}
Let g(x)=xf(x)g(x)=x f(x). Then, we have
g(g(x))=g(xf(x))=xf(x)f(xf(x))=xf(x)2f(f(x))==xf(x)2x3f(x)=(xf(x))5/2=(g(x))5/2 \begin{aligned} g(g(x)) & =g(x f(x))=x f(x) \cdot f(x f(x))=x f(x)^{2} f(f(x))= \\ & =x f(x)^{2} \sqrt{x^{3} f(x)}=(x f(x))^{5 / 2}=(g(x))^{5 / 2} \end{aligned}
and, by induction,
g(g(gn+1(x)))=(g(x))(5/2)n \underbrace{g(g(\ldots g}_{n+1}(x) \ldots))=(g(x))^{(5 / 2)^{n}}
for every positive integer nn.

Consider this for a fixed xx. The left-hand side is always rational, so (g(x))(5/2)n(g(x))^{(5 / 2)^{n}} must be rational for every nn. We show that this is possible only if g(x)=1g(x)=1. Suppose that g(x)1g(x) \neq 1, and let the prime factorization of g(x)g(x) be g(x)=p1α1pkαkg(x)=p_{1}^{\alpha_{1}} \ldots p_{k}^{\alpha_{k}} where p1,,pkp_{1}, \ldots, p_{k} are distinct primes and α1,,αk\alpha_{1}, \ldots, \alpha_{k} are nonzero integers. Then the unique prime factorization is
g(g(gn+1(x)))=(g(x))(5/2)n=p1(5/2)nα1pk(5/2)nαk \underbrace{g(g(\ldots g}_{n+1}(x) \ldots))=(g(x))^{(5 / 2)^{n}}=p_{1}^{(5 / 2)^{n} \alpha_{1}} \ldots p_{k}^{(5 / 2)^{n} \alpha_{k}}
where the exponents should be integers. But this is not true for large values of nn, for example (52)nα1\left(\frac{5}{2}\right)^{n} \alpha_{1} cannot be an integer when 2nα12^{n} \nmid \alpha_{1}. Therefore, g(x)1g(x) \neq 1 is impossible.

Hence, g(x)=1g(x)=1 and thus f(x)=1xf(x)=\frac{1}{x} for all xx.

The function f(x)=1xf(x)=\frac{1}{x} satisfies the equation:
f(f(x)2y)=1f(x)2y=1(1x)2y=x3xy=x3f(xy) f\left(f(x)^{2} y\right)=\frac{1}{f(x)^{2} y}=\frac{1}{\left(\frac{1}{x}\right)^{2} y}=\frac{x^{3}}{x y}=x^{3} f(x y)

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.