Browse · MathNet
Print26th Balkan Mathematical Olympiad
Greece algebra
Problem
Let be the set of positive integers. Find all functions such that
Solution
First we prove that is injective. In fact, for any fixed , if , then: , whence and .
Since is injective we have: Putting , we find for , . Then from (1) we get Since the solution of the equation in positive integers is and , it follows that and .
Also, from (1) we have Since the unique solution in positive integers of the equation is , it follows that and .
Using (1) again we can have as it arises easily by the identity , and therefore , by induction on . Then and thus . Hence , for any . Finally it is easy to verify that , is a solution of the problem.
Since is injective we have: Putting , we find for , . Then from (1) we get Since the solution of the equation in positive integers is and , it follows that and .
Also, from (1) we have Since the unique solution in positive integers of the equation is , it follows that and .
Using (1) again we can have as it arises easily by the identity , and therefore , by induction on . Then and thus . Hence , for any . Finally it is easy to verify that , is a solution of the problem.
Final answer
f(n) = n for all positive integers n
Techniques
Injectivity / surjectivityTechniques: modulo, size analysis, order analysis, inequalities