Browse · MathNet
PrintSAUDI ARABIAN IMO Booklet 2023
Saudi Arabia 2023 number theory
Problem
Denote by the set of positive integers. Find all functions such that divides for every two coprime integers and .
Solution
(Base on the solution of Hadi Alaithan, IMO 2023's team member) Note that for are coprime positive integers, we have Now we state the following lemma: Lemma (Zsigmondy's Theorem): for be coprime integers and , there exists a prime divisor of that does not divide for all , except when and is a power of or .
Back to the original problem, for any coprime integers and , we show that . Suppose that the difference is larger than , then there exists a prime divides . Because and are relatively prime, one of these numbers is not a multiple of . Assume that . By choosing a suitable number , we will show that this is a contradiction.
Denote . By the lemma, for some , there exists a prime such that Similarly, for some such that there exists a prime and It is obvious that and are pairwise relatively prime. By Chinese remainder theorem, there exists a positive integer such that These conditions give Hence and . These give . This is a contradiction.
Now, we show that for all coprime . Choose such that . Then we have Then both and due to the divisibility. We obtain that if and are relatively prime.
In conclusion, is constant on and .
Back to the original problem, for any coprime integers and , we show that . Suppose that the difference is larger than , then there exists a prime divides . Because and are relatively prime, one of these numbers is not a multiple of . Assume that . By choosing a suitable number , we will show that this is a contradiction.
Denote . By the lemma, for some , there exists a prime such that Similarly, for some such that there exists a prime and It is obvious that and are pairwise relatively prime. By Chinese remainder theorem, there exists a positive integer such that These conditions give Hence and . These give . This is a contradiction.
Now, we show that for all coprime . Choose such that . Then we have Then both and due to the divisibility. We obtain that if and are relatively prime.
In conclusion, is constant on and .
Final answer
All functions with f(1) arbitrary in N and f(n)=c for all n≥2, where c is an arbitrary positive integer.
Techniques
Chinese remainder theoremMultiplicative orderGreatest common divisors (gcd)Other