Given are $n$ distinct natural numbers. For any two of them, the one is obtained from the other by permuting its digits (zero cannot be put in the first place). Find the largest $n$ such that it is possible all these numbers to be divisible by the smallest of them?
Problem
Source: St Petersburg 2022 9.7
Tags: number theory
27.10.2022 07:56
Incorrect answer. Please look at #3, #4.
27.10.2022 16:05
youthdoo wrote: Let the smallest number among the $n$ be $x$. Firstly, $n=9$ doesn't work because unless all the digits of $x$ are $1$, $9x$ has more digits than $x$, which is contradictory. However, $11\dots1$ clearly doesn't meet the requirements.
So the largest $n$ is $n=8$.
Try 2/19
27.10.2022 17:49
Thanks for noticing. For $n=9$, we have $$x=105263157894736842.$$(This is obtained from the repetend of $\frac2{19}$.) The numbers $x,2x,\dots,9x$ meet the requirements. For $n\ge10$, the greatest number is at least $10$ times the smallest. So they don't have the same number of digits, which contradicts obviously.
05.11.2023 21:02
Also you can try to write periods of $\frac{1}{97},... \frac{9}{97}$. This also works...