arXiv · 2409.17076
Positive spoof Lehmer factorizations
Abstract
We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial spoof Lehmer factorizations with 6 or fewer factors.
Explore related subjects
Keep this discovery
Grant Molnar, Guntas Singh. 2024-09-25. Positive spoof Lehmer factorizations. https://arxiv.org/abs/2409.17076
Cite the original work for its findings. Save a collection to share your selection of sources.