Browse · MathNet
Print69th Belarusian Mathematical Olympiad
Belarus algebra
Problem
Let be the set of all integers. Find all functions satisfying the following conditions: 1. for all ; 2. takes all integer values.
Solution
Answer: . Let be the set of all integers such that . We prove that .
Claim 1. . Indeed, if then , so .
Claim 2. If then . Indeed, therefore .
From claim 2 it follows that if then has its minimum element and . Suppose that and let be the minimum element of .
From the problem condition 2 we have for some . Then If then we have which contradicts the minimality of . So, and . If then and we have - a contradiction. Further, if then , so - contrary to minimality of . Hence, .
Now let be such that . Then which is impossible for .
The contradiction obtained shows that , i.e. . It is easy to see that the function is suitable.
Claim 1. . Indeed, if then , so .
Claim 2. If then . Indeed, therefore .
From claim 2 it follows that if then has its minimum element and . Suppose that and let be the minimum element of .
From the problem condition 2 we have for some . Then If then we have which contradicts the minimality of . So, and . If then and we have - a contradiction. Further, if then , so - contrary to minimality of . Hence, .
Now let be such that . Then which is impossible for .
The contradiction obtained shows that , i.e. . It is easy to see that the function is suitable.
Final answer
f(x) = x + 1
Techniques
Injectivity / surjectivityExistential quantifiers