Maths Olympiad Prep

Library / /6 of 14

, 2022

Algebra Difficulty 8.2 Shortlist Prove it Balkan Mathematical Olympiad

Find all functions f:(0,)(0,)f: (0, \infty) \to (0, \infty) such that
f(yf(x)3+x)=x3f(y)+f(x) f(yf(x)^3 + x) = x^3 f(y) + f(x)
for all x,y>0x, y > 0.

Solution

Setting y=tf(x)3y = \frac{t}{f(x)^3} we get
f(x+t)=x3f(tf(x)3)+f(x)(1) f(x+t) = x^3 f\left(\frac{t}{f(x)^3}\right) + f(x) \quad (1)
for every x,t>0x, t > 0.
From (1) it is immediate that ff is increasing.

Claim. f(1)=1f(1) = 1

Proof of Claim. Let c=f(1)c = f(1). If c<1c < 1, taking x=1x = 1 and y=11c3y = \frac{1}{1-c^3} we have yyc3=1y - yc^3 = 1, so yf(1)3+1=yyf(1)^3 + 1 = y and f(yf(1)3+1)=f(y)=13f(y)f(yf(1)^3 + 1) = f(y) = 1^3 f(y). Thus f(1)=0f(1) = 0, a contradiction. Assume now for contradiction that c>1c > 1. We claim that
f(1+c3++c3n)=(n+1)c f(1 + c^3 + \cdots + c^{3n}) = (n+1)c
for every nNn \in \mathbb{N}. We proceed by induction, the case n=0n = 0 being trivial. The inductive step follows easily by taking x=1,t=c3+c6++c3(k+1)x = 1, t = c^3 + c^6 + \cdots + c^{3(k+1)} in (1).
Now taking x=1+c3++c3n3x = 1 + c^3 + \cdots + c^{3n-3}, t=c3nt = c^{3n} in (1) we get
(n+1)c=f(1+c3++c3n)=(1+c3++c3n3)f(c3n(n+1)3)+nc (n+1)c = f(1 + c^3 + \cdots + c^{3n}) = (1 + c^3 + \cdots + c^{3n-3})f\left(\frac{c^{3n}}{(n+1)^3}\right) + nc
giving
f(c3n(n+1)3)=c(1+c3++c3n)3<c=f(1)    c3n(n+1)3<1. f\left(\frac{c^{3n}}{(n+1)^3}\right) = \frac{c}{(1+c^3+\cdots+c^{3n})^3} < c = f(1) \implies \frac{c^{3n}}{(n+1)^3} < 1.
But this leads to a contradiction if nn is large enough. □

Now for x=1x = 1 we get f(y+1)=f(y)+1f(y+1) = f(y)+1 and since f(1)=1f(1) = 1 inductively we get f(n)=nf(n) = n for every nNn \in \mathbb{N}. For m,nNm, n \in \mathbb{N}, setting x=n,y=q=m/nx = n, y = q = m/n we get
mn2+n=f(qn3+n)=f(yf(x)3+x)=x3f(y)+f(x)=n3f(q)+n    f(q)=q. mn^2 + n = f(qn^3 + n) = f(yf(x)^3 + x) = x^3f(y) + f(x) = n^3f(q) + n \implies f(q) = q.
Since ff is strictly increasing with f(q)=qf(q) = q for every qQ>0q \in \mathbb{Q}^{>0} we deduce that f(x)=xf(x) = x for every x>0x > 0. It is easily checked that this satisfies the functional 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 and solution reproduced as published; topic and difficulty added by this site.