Browse · MathNet
Print74th NMO Selection Tests for JBMO
Romania number theory
Problem
For each positive integer let be the sum of its positive divisors and be the number of the positive divisors of . Find all positive integers such that .
Solution
Let and let be a divisor of , such that . Since also divides and , we infer that , for any , (1).
Also, if are the divisors of , then But, if divides , then . Consequently, , (2).
We infer that .
Successively, this leads to Suppose, by contradiction, that . Then and , which is a contradiction. Hence, , which means that can only have one of the following forms: , where are prime numbers.
Every such possible has at most 12 divisors. Studying all cases for , we easily find that the only solutions are and .
Also, if are the divisors of , then But, if divides , then . Consequently, , (2).
We infer that .
Successively, this leads to Suppose, by contradiction, that . Then and , which is a contradiction. Hence, , which means that can only have one of the following forms: , where are prime numbers.
Every such possible has at most 12 divisors. Studying all cases for , we easily find that the only solutions are and .
Final answer
1, 3, 4, 12
Techniques
τ (number of divisors)σ (sum of divisors)