Positive spoof Lehmer factorizations
arXiv:2409.17076
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.
11 pages; 2 tables