Positive spoof Lehmer factorizations
Number Theory
2025-11-19 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.2409.17076,
title = {Positive spoof Lehmer factorizations},
author = {Grant Molnar and Guntas Singh},
journal= {arXiv preprint arXiv:2409.17076},
year = {2025}
}
Comments
11 pages; 2 tables