arXiv · 2502.15559
Divisibility rules for integers presented as permutations
Abstract
In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the factoradic digits, and use this to deduce various divisibility rules.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Thomas Oliver, Alexei Vernitski. 2025-02-21. Divisibility rules for integers presented as permutations. https://arxiv.org/abs/2502.15559
Cite the original work for its findings. Save a collection to share your selection of sources.