Positive spoof Lehmer factorizations
<|reference_start|>Positive spoof Lehmer factorizations: We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial positive spoof Lehmer factorizations with a fixed number of bases $r$, and enumerate all nontrivial positive spoof Lehmer factorizations with 6 or fewer factors.<|reference_end|>
@article{molnar2024positive,
    title={Positive spoof Lehmer factorizations},
    author={Grant Molnar and Guntas Singh},
    journal={arXiv preprint arXiv:2409.17076},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.17076},
    primaryClass={math.NT cs.DM}
}