OFFSET
1,1
COMMENTS
For powers of 2, the two function values are equal.
Numbers m such that m/phi(m) > 2. - Charles R Greathouse IV, Sep 13 2013
Numbers m such that there are powers of m that are abundant. This follows from abundancy and totient being multiplicative, with the abundancy for prime p of p^k being asymptotically p/(p-1) as k -> oo; given that p/(p-1) = p^k/phi(p^k) for k >= 1. - Peter Munn, Nov 24 2020
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Mitsuo Kobayashi, A generalization of a series for the density of abundant numbers, International Journal of Number Theory, Vol. 12, No. 3 (2016), pp. 671-677.
FORMULA
a(n) seems to be asymptotic to c*n with c=1.9566...... - Benoit Cloitre, Oct 20 2002 [It is an old theorem that a(n) ~ cn for some c, for any sequence of the form "m/phi(m) > k". - Charles R Greathouse IV, May 28 2015] [c is in the interval (1.9540, 1.9562) (Kobayashi, 2016). - Amiram Eldar, Feb 14 2021]
EXAMPLE
For m = 20, phi(20) = 8, cototient(20) = 20 - phi(20) = 12, 8 = phi(20) < 20-phi(20) = 12; for m = 21, the opposite holds: phi = 12, 21-phi = 8.
MATHEMATICA
Select[ Range[300], 2EulerPhi[ # ] < # &] (* Robert G. Wilson v, Jan 10 2004 *)
PROG
(PARI) is(n)=n>2*eulerphi(n) \\ Charles R Greathouse IV, Sep 13 2013
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 26 2000
EXTENSIONS
Erroneous comment removed by Antti Karttunen, Jan 05 2019
STATUS
approved