Denote by the set of all positive real numbers. Find all functions such that
for all positive real numbers and . Answer. for any . ! hence . Swapping and in (1) and comparing with (1) again, we find
Taking in (2), we have , that is,
Take in (1) and apply (3) to . We get , which implies
For any , we find that
It remains to show the following key step.
- Claim. The function is injective.
Proof. Using (3) and (4), we rewrite (1) as
Take in (6) and apply (3). This gives , which means
Using (3), equation (2) can be rewritten as
Suppose for some . Then (8) implies
Using (7), this gives
Noting , we find . This establishes the injectivity.
By the Claim and (5), we get the only possible solution . It suffices to check that this is a solution. Indeed, the left-hand side of (1) becomes
while the right-hand side becomes
The two sides agree with each other.
Solution
Taking in (1), we get and hence . Putting in (1), we have so that
Putting in (1), we get . Using (9), this gives
Replace by in (1). Then we have
The relation (10) shows . Also, using (9) with and using (10) again, the last equation reduces to
Replace by and by in (1) and apply (11). We get
Clearing denominators, we can use (1) to simplify the numerators and obtain
Using (9) and (10), this is the same as
Substitute in (12) and apply (10) (with replaced by ). We have
Taking in (12), squaring both sides, and using (10) and (13), we find that
Finally, we combine (9), (10) and (14) to get
which implies . This is a solution by the checking in Solution 1.
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.