Browse · MathNet
PrintIranian Mathematical Olympiad
Iran number theory
Problem
For a positive integer , let and be the number of positive divisors of and the sum of positive divisors of , respectively. Let and be positive integers such that divides for all . Prove that each prime factor of divides .
Solution
We have and so it suffices to prove that for each there is an integer such that . Assume the contrary, suppose that there is some integer such that . It is well known that the sequence has infinitely many prime divisors. Consider a large prime , such that , and We can also assume that by taking . Now by Chinese remainder theorem for each , there is an integer such that , for some positive integer .
By the lifting the exponent lemma, . But because we have . Hence if we have
and if then by Fermat's little theorem and we again have In concise so if we consider we would obtain , a contradiction. ■
By the lifting the exponent lemma, . But because we have . Hence if we have
and if then by Fermat's little theorem and we again have In concise so if we consider we would obtain , a contradiction. ■
Techniques
τ (number of divisors)σ (sum of divisors)Chinese remainder theoremFermat / Euler / Wilson theoremsMultiplicative orderTechniques: modulo, size analysis, order analysis, inequalities