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.

翻译：我们研究了与Lehmer欧拉函数猜想相关的丢番图方程的整数解。我们给出了一种算法，用于计算具有固定基数$r$的所有非平凡正伪Lehmer因子分解，并枚举了所有具有6个或更少因子的非平凡正伪Lehmer因子分解。