CMO 1984 Problem 3
- Paper
An integer is digitally divisible if both of the following conditions are fulfilled: None of its digits is zero; It is divisible by the sum of its digits e.g. is digitally divisible. Show that there are infinitely many digitally divisible integers.
Dataset text AI-MO AoPS. 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.