Problem:
Find all functions such that
for all .
Solution
Solution:
Let be the problem statement. Note that if where , then and imply . Thus is injective.
Then implies , so by injectivity we obtain .
Now gives . Combining this with , we obtain .
Setting here yields , and so . In particular, this implies for some constant .
Substituting this into , we obtain
which implies that . It is easy to see that works and is therefore the only solution.
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.