A method for finding all permutiples with a fixed set of digits from a single known example (Q6943860)

In recreational mathematics, it is famously known that \(2\cdot142857=285714\), where one observes that the digits of the product is cyclic permutation of the mutiplicant. Similarly, \(3\cdot142857=428571\), \(4\cdot142857=571428\), \(5\cdot142857=714285\), and \(6\cdot142857=857142\). But unexpectedly, \(7\cdot142857=999999\). The mystery partly disappears when one remembers that \(\frac{1}{7}=0.\overline{142857}\), similar representations for \(\frac{2}{7}, \frac{3}{7},\ldots,\frac{6}{7}\), and \(\frac{7}{7}=0.\overline{9}=1\). An analogous observation can be made for the digits of \(\frac{1}{17}= 0.\overline{0588235294117647}\). The theory of such numbers was studied by \textit{S. Guttman} [Am. Math. Mon. 41, 159--166 (1934; Zbl 0009.00603)]. A less known reference is the collective paper of the readers in the soviet journal Kvant (Russian: Квант) [``The amazing adventures of periodic fractions'', Kvant 1989, No. 8, 22--30 (1989)], where the connections of these numbers with the repunit numbers were explored (see \url{https://www.kvant.digital/view/kvant_1989_8/p0/}). \N\NThe author of the paper under review generalizes the idea by introducing the concept of \textit{permutiples} which are multiples of a permutation (not just cyclic) of its digits in [\textit{B. V. Holt}, Integers 17, Paper A20, 21 p. (2017; Zbl 1412.11012)]. The paper under review gives a simpler and, at the same time, more general method for finding all permutiples for the same set of digits from one known example.