olymmath

IT-CESENATICO 1997 Problem 5

    Let XX be the set of natural numbers whose all digits in the decimal representation are different. For n∈Nn \in N , denote by AnA_n the set of numbers whose digits are a permutation of the digits of nn , and dnd_n be the greatest common divisor of the numbers in AnA_n . (For example, A1120={112,121,...,2101,2110}A_{1120} =\{112,121,...,2101,2110\} , so d1120=1d_{1120} = 1 .) Find the maximum possible value of dnd_n .

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator it-cesenatico/1997/p5 · Tag Z61CRYKZMF · Edit this page on GitHub · Keys: j next, k previous