Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia number theory
Problem
A positive integer is called nice if for any pair () of positive integers satisfying the condition we have . 1. Prove that is a nice number; 2. Find all nice numbers.
Solution
1) For , we need to prove that for all satisfying then . Note that or , then .
Then . We consider some cases:
- If then . - If then . - If then . - If then .
So in all cases, we always have , which implies that is a nice number.
2) We can directly check that is a nice number. Consider some nice number . By a similar way, we can check that and Thus . In case , we have We must have then . Since , this means that or .
It is easy to check that is also a nice number. Therefore, all nice numbers are .
Then . We consider some cases:
- If then . - If then . - If then . - If then .
So in all cases, we always have , which implies that is a nice number.
2) We can directly check that is a nice number. Consider some nice number . By a similar way, we can check that and Thus . In case , we have We must have then . Since , this means that or .
It is easy to check that is also a nice number. Therefore, all nice numbers are .
Final answer
2, 3, 5
Techniques
Divisibility / Factorization