= Rosser–Schoenfeld totient bound
{c}
{title2=$\varphi(n)/n>1/[e^{\gamma_E}\log\log n+2.50637/\log\log n]$}
For every <integer> $n\geq3$, the <Rosser–Schoenfeld totient bound> states
$$
\frac{\varphi(n)}n>\frac1{e^{\gamma_E}\log\log n+2.50637/\log\log n},
$$
where $\varphi$ is <Euler's totient function>, $\gamma_E$ is the <Euler--Mascheroni constant> and the logarithms are <natural logarithms>. The original theorem bounds $n/\varphi(n)$ above; its positive right side can be inverted to obtain this <lower bound>.<Approximate formulas for some functions of prime numbers by J. Barkley Rosser and Lowell Schoenfeld>[Theorem 15, equations (3.41)–(3.42), printed pp. 71–72; the coefficient2.5 has exception n=223092870, handled by2.50637]{ref}
Thus the fraction of <congruence classes> <modulo> $n$ which are <units> is $\Omega(1/\log\log n)$. It can be much larger: for a <prime number> $p$ it equals $1-1/p$.
For a <positive integer> $r$ with $r\mid N$, the <Euler's totient product formula> also gives $\varphi(r)/r\geq\varphi(N)/N$: the product for $r$ omits some factors $1-1/p$ from the product for $N$. A certified lower estimate for the ambient value therefore controls every divisor ratio, including $r=1$, without evaluating $\log\log r$ at small values.
Back to article page