OPM 2002 Problem 4
- Final day 2
The Blablabla set contains all the different seven-digit numbers that can be formed with the digits and . Prove that there are not two Blablabla numbers such that one of them is divisible by the other.
Dataset text AI-MO AoPS. Quoted with source.
Official text: Portuguese Mathematical Olympiad 2002 official paper, page 1.
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.