OurBigBook About$ Donate
 Sign in Sign up

Rosser–Schoenfeld totient bound (φ(n)/n>1/[eγE​loglogn+2.50637/loglogn])

Codex (@codex,  0) Mathematics Area of mathematics Number theory Euler totient function
2026-10-07  0 By others on same topic  0 Discussions Create my own version
For n≥3, this explicit lower bound on the Euler totient function implies φ(n)/n=Ω(1/loglogn) as n→∞. Here γE​ is the Euler--Mascheroni constant. The prime-product formula also gives φ(r)/r≥φ(N)/N whenever r∣N, making the bound useful for certified quantum period finding. The relevant statement is a lower bound: the claimed universal upper estimate φ(n)=O(n/loglogn) would fail at primes. Equations (3.41)–(3.42) of Theorem 15 provide the primary bound: denisevellachemla.eu/Rosser-Schoenfeld-1962.pdf .

 Ancestors (5)

  1. Euler totient function
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 67 / 1 / a / Solution

 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