Browse · MathNet
Print55rd Ukrainian National Mathematical Olympiad - Third Round
Ukraine number theory
Problem
Find all integers that have more than divisors.
Solution
Answer: .
Clearly a number cannot have divisors greater than , besides itself. Therefore, in order to have more than divisors it must be divisible by all numbers from to and by . Denote by the integer number which equals either or . Then if , either or is coprime with . Hence, , because it must be divisible by both and . However, in this case , or , which contradicts the assumption that . All numbers can be checked by hand.
Clearly a number cannot have divisors greater than , besides itself. Therefore, in order to have more than divisors it must be divisible by all numbers from to and by . Denote by the integer number which equals either or . Then if , either or is coprime with . Hence, , because it must be divisible by both and . However, in this case , or , which contradicts the assumption that . All numbers can be checked by hand.
Final answer
1, 2, 3, 4, 6
Techniques
τ (number of divisors)Greatest common divisors (gcd)