Denote by Q+ the set of all positive rational numbers. Determine all functions f:Q+→Q+ which satisfy the following equation for all x,y∈Q+: f(f(x)2y)=x3f(xy)
Solution
By substituting y=1, we get f(f(x)2)=x3f(x) Then, whenever f(x)=f(y), we have x3=f(x)f(f(x)2)=f(y)f(f(y)2)=y3 which implies x=y, so the function f is injective.
Now replace x by xy in the previous equation, and apply the original equation twice, the second time to (y,f(x)2) instead of (x,y): f(f(xy)2)=(xy)3f(xy)=y3f(f(x)2y)=f(f(x)2f(y)2) Since f is injective, we get f(xy)2f(xy)=f(x)2f(y)2=f(x)f(y) Therefore, f is multiplicative. This also implies f(1)=1 and f(xn)=f(x)n for all integers n.
Then the functional equation can be re-written as f(f(x))2f(y)f(f(x))=x3f(x)f(y),=x3f(x) Let g(x)=xf(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 and, by induction, n+1g(g(…g(x)…))=(g(x))(5/2)n for every positive integer n.
Consider this for a fixed x. The left-hand side is always rational, so (g(x))(5/2)n must be rational for every n. We show that this is possible only if g(x)=1. Suppose that g(x)=1, and let the prime factorization of g(x) be g(x)=p1α1…pkαk where p1,…,pk are distinct primes and α1,…,αk are nonzero integers. Then the unique prime factorization is n+1g(g(…g(x)…))=(g(x))(5/2)n=p1(5/2)nα1…pk(5/2)nαk where the exponents should be integers. But this is not true for large values of n, for example (25)nα1 cannot be an integer when 2n∤α1. Therefore, g(x)=1 is impossible.
Hence, g(x)=1 and thus f(x)=x1 for all x.
The function f(x)=x1 satisfies the equation: f(f(x)2y)=f(x)2y1=(x1)2y1=xyx3=x3f(xy)
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.