A Method for Finding All Permutiples with a Fixed Set of Digits from a Single Known Example
Abstract
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers (multiples of their digit reversals). While cyclic numbers have a fairly straightforward description, palintiple numbers admit many varieties and cases. A previous paper attempts to get a better handle on the general case by constructing new examples of permutiples with the same set of digits, multiplier, and length as a known example. However, the results are not sufficient for finding all possible examples except when the multiplier divides the base. Using an approach based on the methods of this previous paper, we develop a new method which enables us to find all examples under any conditions.
Keywords
Cite
@article{arxiv.2312.02056,
title = {A Method for Finding All Permutiples with a Fixed Set of Digits from a Single Known Example},
author = {Benjamin V. Holt},
journal= {arXiv preprint arXiv:2312.02056},
year = {2025}
}
Comments
This version is updated to include additional expository information, as well as a new example to further illustrate the methods presented in the paper