References
- P. Burcsi, S. Czirbusz, G. Farkas, Computational investigation of Lehmer’s totient problem, Ann. Univ. Sci. Budapest. Sect. Comput. 35 (2011), 43-49.
- D. Burek, B. Żmija, A new upper bound for numbers with the Lehmer property and its application to repunit numbers, Int. J. Number Theory 15, no. 7 (2019), 1463-1468.
- G. L. Cohen, P. Hagis, On the number of prime factors of n if ϕ(n)|(n − 1), Nieuw. Arch. Wisk. (3) 28, no. 2 (1980), 177-185.
- M. Deaconescu, Adding units mod n, Elem. Math. 55, no. 3 (2000), 123-127.
- E. Hasanalizade, On a conjecture of Deaconescu, Integers 22 (2022), #A99.
- S. H. Hernandez, F. Luca, A note on Deaconescu’s result concerning Lehmer’s problem, Integers 8 (2008), #A12.
- D. H. Lehmer, On Euler’s totient function, Bull. Amer. Math. Soc. 38 (1932), 745-751.
- P. Nielsen, Odd perfect numbers, Diophantine equations, and upper bounds, Math. Comp. 84 (2015), 2549-2567.
- C. Pomerance, On composite n for which ϕ(n)|n − 1, II, Pacific J. Math. 69, no. 1 (1977), 177-186.