Maths Olympiad Prep

Library / Ukrainian National Mathematical Olympiad - Third Round /6 of 15

Ukrainian National Mathematical Olympiad - Third Round

Number theory Difficulty 5.1 AIME, harder Prove it Ukraine

Find all integers nn that have more than n2\frac{n}{2} divisors.

Solution

Answer: n∈{1;2;3;4;6}n \in \{1; 2; 3; 4; 6\}.

Clearly a number cannot have divisors greater than n2\frac{n}{2}, besides nn itself. Therefore, in order to have more than n2\frac{n}{2} divisors it must be divisible by all numbers from 11 to n2\frac{n}{2} and by nn. Denote by mm the integer number which equals either n2\frac{n}{2} or n−12\frac{n-1}{2}. Then if n≥10n \ge 10, either mm or m−1m-1 is coprime with 33. Hence, n≥3mn \ge 3m, because it must be divisible by both 33 and mm. However, in this case n≥3⋅(n−12−1)n \ge 3 \cdot (\frac{n-1}{2} - 1), or 2n≥3n−92n \ge 3n - 9, which contradicts the assumption that n≥10n \ge 10. All numbers n<10n < 10 can be checked by hand.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.