Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia number theory
Problem
Find all pair of integers (, ) and such that there exist a positive integer and 1. Product of all divisors of , are equal. 2. Number of divisors of , are equal.
Solution
1) Denote , as the number of divisors, the product of divisors of positive integer . Firstly, we can see that for any divisor of , then is also divisor of , thus Thus for any then implies that share the common prime divisors set . Suppose that and take . Since , we have . Since , we get . And this is true for all , thus So , which implies that . Therefore, we can find a positive integer such that product of all divisors of , are equal if and only if .
2) Firstly, we can see that if then any divisor of is also divisor of , so . We consider , and denote be all prime dividing . Suppose that Now we are looking for such that Note that if , then regardless of the value of , the corresponding factor equals to 1 and does not affect the product. So we may assume that for all .
Claim. Let be nonnegative integers. Then for every , there exist a nonnegative integer such that It is equivalent to , which is true.
Back to the original problem, we can assume that for and for . Take some big enough and choose such that - for . - for . Then we have
2) Firstly, we can see that if then any divisor of is also divisor of , so . We consider , and denote be all prime dividing . Suppose that Now we are looking for such that Note that if , then regardless of the value of , the corresponding factor equals to 1 and does not affect the product. So we may assume that for all .
Claim. Let be nonnegative integers. Then for every , there exist a nonnegative integer such that It is equivalent to , which is true.
Back to the original problem, we can assume that for and for . Take some big enough and choose such that - for . - for . Then we have
Final answer
1) The product-of-divisors condition holds if and only if m = n. 2) The equal-divisor-count condition holds if and only if either m = n or n does not divide m (equivalently, m and n are not comparable by divisibility).
Techniques
τ (number of divisors)Factorization techniques