References Lehmer's_totient_problem
cohen, graeme l.; hagis, peter, jun. (1980). on number of prime factors of n if φ(n) divides n−1 . nieuw arch. wiskd., iii. ser. 28: 177–185. issn 0028-9825. zbl 0436.10002.
guy, richard k. (2004). unsolved problems in number theory (3rd ed.). springer-verlag. b37. isbn 0-387-20860-7. zbl 1058.11001.
hagis, peter, jun. (1988). on equation m⋅φ(n)=n−1 . nieuw arch. wiskd., iv. ser. 6 (3): 255–261. issn 0028-9825. zbl 0668.10006.
lehmer, d. h. (1932). on euler s totient function . bulletin of american mathematical society. 38: 745–751. doi:10.1090/s0002-9904-1932-05521-5. issn 0002-9904. zbl 0005.34302.
ribenboim, paulo (1996). new book of prime number records (3rd ed.). new york: springer-verlag. isbn 0-387-94457-5. zbl 0856.11001.
sándor, józsef; mitrinović, dragoslav s.; crstici, borislav, eds. (2006). handbook of number theory i. dordrecht: springer-verlag. isbn 1-4020-4215-9. zbl 1151.11300.
burcsi, péter; czirbusz, sándor; farkas, gábor (2011). computational investigation of lehmer s totient problem . ann. univ. sci. budap. rolando eötvös, sect. comput. 35: 43–49. issn 0138-9491. mr 2894552. zbl 1240.11005.
Comments
Post a Comment