Multigraph characterization of permutiple strings (Q6861660)

\[\N2 \cdot 1176470588235294 = 2352941176470588\N\]\NThe digits of the multiplicand and the product are the same. The above example is also cyclic. If any permutation is allowed, then these types of numbers are so-called ``permutiples''.\N\NFinding them using exhaustive brute-force verification may require more computational power than one can afford. So, the author of the paper under review suggested a different approach. For each base \(b\) and factor \(n\), one can find the directed graph with vertices \(0, 1, 2, \dots, b-1\) and edges \(x \to y\) if digit \(x\) becomes \(y\) in long multiplication by \(n\). This also includes the results obtained by carries from the lower-order place values.\N\NEvery permutiple is interpreted as a part of this ``mother graph.'' Then, the Hoey-Sloane multigraph, with vertices as carries and edges as \(x \to y\), is constructed. This finite-state-machine interpretation is used to give sufficient conditions for the existence of permutiples. The condition is expressed using Eulerian circuits starting and ending with a zero carry.