Browse · MathNet
Print41st Balkan Mathematical Olympiad
number theory
Problem
Let and be distinct positive integers such that is divisible by . Prove that .
Solution
Obviously we have . Let , where . Then So divides and it follows that We make case distinction:
1. . Then and or , a contradiction.
2. is even. Then Consider both sides of the last equation modulo . Since : so it follows that . If then , a contradiction. So , and therefore: It follows that Consequently .
3. If is odd. Then Considering both sides of the last equation modulo , and since , we get: is divisible by and therefore . Thus because , and: But for we have , which combined with the above inequality, implies that , q.e.d. Finally, If then and consequently , a contradiction.
□
---
Alternative solution.
, and we shall show . We have , so . Let where . First suppose that . We have Therefore Hence Which yields as desired. Now for the case , and so and analogous to the previous case, . □
1. . Then and or , a contradiction.
2. is even. Then Consider both sides of the last equation modulo . Since : so it follows that . If then , a contradiction. So , and therefore: It follows that Consequently .
3. If is odd. Then Considering both sides of the last equation modulo , and since , we get: is divisible by and therefore . Thus because , and: But for we have , which combined with the above inequality, implies that , q.e.d. Finally, If then and consequently , a contradiction.
□
---
Alternative solution.
, and we shall show . We have , so . Let where . First suppose that . We have Therefore Hence Which yields as desired. Now for the case , and so and analogous to the previous case, . □
Techniques
Divisibility / FactorizationModular ArithmeticExponential functions