KöMaL 2019 K618
A positive integer is said to be a ``strong'' number if its number of divisors is greater than the number of divisors of each positive integer less than . (For example, is a strong number, because it has two divisors, while has only one. But is not a strong number, because it has two divisors similarly to a smaller integer .) Find all strong numbers greater than 2 but less than 30. Is a strong number?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.