AlgebraDifficulty 8.7ShortlistProve itUnited States
Determine all functions f:(0,∞)→(0,∞) such that f(r2)+f(s2)(f(p))2+(f(q))2=r2+s2p2+q2 for all positive real numbers p, q, r, s satisfying pq=rs.
Solution
f(x)=xandf(x)=x1. It is easy to check that these two functions satisfy the conditions of the problem. We now show that they are the only functions satisfying the conditions of the problem. Setting p=q=r=s=1 in (∗) gives f(1)=f(1)+f(1)(f(1))2+(f(1))2=11+1212+12=1. For positive real numbers x, setting (p,q,r,s)=(1,x,x,x) in (∗) yields 2f(x)1+(f(x))2=2f(x)(f(1))2+(f(x))2=2x1+x2or2x+2x(f(x))2=2f(x)+2x2f(x). We deduce that 0=x(f(x))2−x2f(x)+x−f(x)=(x−f(x))(1−xf(x)). It follows that for positive real numbers x, either f(x)=xorf(x)=x1. Let us assume that f(x)=x and f(x)=x1. Then there are positive real numbers a and b such that f(a)=a and f(b)=b1. We deduce that f(a)=a1 and f(b)=b. Setting (p,q,r,s)=(a,b,ab,ab) in (∗) gives 2f(ab)a21+b2=2f(ab)(f(a))2+(f(b))2=2aba2+b2 or abf(ab)=a2(a2+b2)1+a2b2=a4+a2b21+a2b2.(†) We know that either f(ab)=ab or f(ab)=ab1. If f(ab)=ab, then (†) implies that a4=1 or a=1, but then f(a)=f(1)=1=a, violating our assumption of f(a)=a. If f(ab)=ab1, then (†) implies that b2+a2b4=a2+b2 or b=1, but then f(b)=f(1)=1=b1, violating our assumption of f(b)=b1. We reach contradictions in both cases. Thus, our assumption was wrong and no such a and b exist. In other words, f(x)=x and f(x)=x1 are the only solutions of the problem.
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 reproduced verbatim; metadata (topic, difficulty) added by this project.