On sparsely totient numbers
Keyword(s):
Following Masser and Shiu [6] we say that a positive integer n is sparsely totient ifHere φ is the familiar Euler totient function. We write ℱ for the set of sparsely totient numbers. In [6] several results are proved about the multiplicative structure of ℱ. If we write P(n) for the largest prime factor of n then it was shown (Theorem 2 of [6]) thatand infinitely often
1991 ◽
Vol 110
(1)
◽
pp. 1-3
◽
Keyword(s):
2018 ◽
Vol 99
(03)
◽
pp. 369-375
2009 ◽
Vol 79
(3)
◽
pp. 455-463
◽
Keyword(s):
2018 ◽
Vol 107
(1)
◽
pp. 133-144
◽
Keyword(s):
1996 ◽
Vol 119
(2)
◽
pp. 201-208
◽
1961 ◽
Vol 5
(1)
◽
pp. 35-40
◽
1955 ◽
Vol 7
◽
pp. 347-357
◽
1968 ◽
Vol 9
(2)
◽
pp. 146-151
◽
1953 ◽
Vol 1
(3)
◽
pp. 119-120
◽
1963 ◽
Vol 6
(2)
◽
pp. 70-74
◽