OME 2003 Problem 1
Prove that for any prime , different than and , there exists such a multiple of whose digits are all nines. For example, if , such a multiple is .
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.