Browse · MathNet
Print24th Balkan Mathematical Olympiad
Greece algebra
Problem
Find all positive integers such that there is a permutation of the set for which is a rational number.
: A permutation of the set is a one-to-one function of this set to itself.
: A permutation of the set is a one-to-one function of this set to itself.
Solution
Let for some we have Squaring the two parts of (1) we conclude that the number is rational. Similarly we obtain that, for each , the number In the sequel we denote by , for each . Using induction we can prove that , for every , and therefore If is a positive integer satisfying the inequalities , then for some we have . Now we distinguish two cases
1ª case: Then we have from which it follows that Squaring both parts of (2) we get from which it follows that , which is absurd.
2ª case: If , then . Let now such that . Similarly, as in the first case, we get which is absurd. If , then . Checking all the cases it is easy to see that only for and there exist permutations satisfying the relation we seek. More explicitly, for we have , while for we have:
1ª case: Then we have from which it follows that Squaring both parts of (2) we get from which it follows that , which is absurd.
2ª case: If , then . Let now such that . Similarly, as in the first case, we get which is absurd. If , then . Checking all the cases it is easy to see that only for and there exist permutations satisfying the relation we seek. More explicitly, for we have , while for we have:
Final answer
n = 1 or n = 3
Techniques
Linear and quadratic inequalitiesIntegers