IT-CESENATICO 1997 Problem 5
Let be the set of natural numbers whose all digits in the decimal representation are different. For , denote by the set of numbers whose digits are a permutation of the digits of , and be the greatest common divisor of the numbers in . (For example, , so .) Find the maximum possible value of .
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.