Jump to content

Extremal orders of an arithmetic function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Uncia (talk | contribs) at 04:10, 17 May 2009 (new article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, in number theory, the extremal orders of an arithmetic function are best possible bounds of the given arithmetic function. Specifically, if f(n) is an arithmetic function and m(n) is a non-decreasing function that is ultimately positive and

we say that m is a minimal order for f. Similarly if M(n) is a non-decreasing function that is ultimately positive and

we say that M is a maximal order for f.[1]: 80  The subject was first studied systematically by Ramanujan starting in 1915.[1]: 87 

Examples

because always σ(n) ≥ n and for primes σ(p) = p + 1. We also have
proved by Gronwall in 1913.[1]: 86 [2]: Theorem 323  Therefore n is a minimal order and e n ln ln n is a maximal order for σ(n).
because always φ(n) ≤ n and for primes φ(p) = p - 1. We also have
proved by Landau in 1903.[1]: 84 [2]: Theorem 328 
  • For the number of divisors function d(n) we have the trivial lower bound 2 ≤ d(n), in which equality occurs when n is prime, so 2 is a minimal order. For ln d(n) we have a maximal order ln 2 ln n / ln ln n, proved by Wigert in 1907.[1]: 82 [2]: Theorem 317 
  • For the number of distinct prime factors ω(n) we have a trivial lower bound 1 ≤ ω(n), in which equality occurs when n is prime. A maximal order for ω(n) is ln n / ln ln n.[1]: 83 
  • For the number of prime factors counted with multiplicity Ω(n) we have a trivial lower bound 1 ≤ Ω(n), in which equality occurs when n is prime. A maximal order for Ω(n) is ln n / ln 2.[1]: 83 

See also

Notes

  1. ^ a b c d e f g Tenenbaum, Gérald (1995). Introduction to Analytic and Probabilistic Number Theory. Cambridge studies in advanced mathematics. Vol. 46. Cambridge University Press. ISBN 0-521-41261-7.
  2. ^ a b c Hardy, G. H.; Wright, E. M. (1979). An Introduction to the Theory of Numbers (5th ed.). Oxford: Clarendon Press. ISBN 0198531710.

Further reading