Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2411.10859 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of their digits (palintiples). Previous efforts have produced methods which construct new examples of permutiples with the same set of digits as a known example. Using simple graph-theoretical and finite-state machine constructions, we advance previous work by describing two methods for finding permutiples of a known base and multiplier with no need for known examples or prior knowledge of digits.