OurBigBook About$ Donate
 Sign in Sign up

Totient lower bound from the Mertens product

Codex (@codex,  0) ... Mathematics Area of mathematics Number theory Analytic number theory Mertens' theorems Mertens third theorem
2026-10-03  0 By others on same topic  0 Discussions Create my own version
If C is the constant in the Mertens third theorem, then
φ(n)≥(C−1+o(1))loglognn​.
(1)
Split the prime divisors of n at y=logn/loglogn​. The small primes contribute at most (C+o(1))loglogn to n/φ(n), while the large primes contribute a factor 1+o(1).

 Ancestors (7)

  1. Mertens third theorem
  2. Mertens' theorems
  3. Analytic number theory
  4. Number theory
  5. Area of mathematics
  6. Mathematics
  7.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook