Extremal Orders Of An Arithmetic Function

In mathematics, specifically 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
:$\liminf_ \frac = 1$
we say that ''m'' is a minimal order for ''f''. Similarly if ''M''(''n'') is a non-decreasing function that is ultimately positive and
:$\limsup_ \frac = 1$
we say that ''M'' is a maximal order for ''f''.

Here, $\liminf_$ and $\limsup_$ denote the limit inferior and limit superior, respectively.

The subject was first studied systematically by Ramanujan starting in 1915.

Examples

* For the sum-of-divisors function σ(''n'') we have the trivial result $\liminf_ \frac = 1$ because always σ(''n'') ≥ ''n'' and for primes σ(''p'') = ''p'' + 1. We also have $\limsup_ \frac = e^\gamma,$ proved by Gronwall in 1913.

Therefore ''n'' is a minimal order and is a maximal order for σ(''n'').
* For the Euler totient φ(''n'') we have the trivial result $\limsup_ \frac = 1$ because always φ(''n'') ≤ ''n'' and for primes φ(''p'') = ''p'' − 1. We also have $\liminf_ \frac = e^,$ proven by Landau in 1903.
* 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 , proved by Wigert in 1907.
* For the number of distinct prime factors ω(''n'') we have a trivial lower bound 1 ≤ ω(''n''), in which equality occurs when ''n'' is a prime power. A maximal order for ω(''n'') is .
* 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
* It is conjectured that the Mertens function, or summatory function of the Möbius function, satisfies $\limsup_ \frac = +\infty,$ though to date this limit superior has only been shown to be larger than a small constant. This statement is compared with the disproof of Mertens conjecture given by Odlyzko and te Riele in their several decades old breakthrough paper ''Disproof of the Mertens Conjecture''. In contrast, we note that while extensive computational evidence suggests that the above conjecture is true, i.e., along some increasing sequence of $\_$ tending to infinity the average order of $\sqrt , M(x_n),$ grows unbounded, that the Riemann hypothesis is equivalent to the limit $\lim_ M(x) / x^ = 0$ being true for all (sufficiently small) $\varepsilon > 0$.

See also

* Average order of an arithmetic function
* Normal order of an arithmetic function

Notes

Further reading

* {{cite book , last1=Nicolas , first1=J.-L. , editor1-first=G. E. , editor1-last=Andrews , editor1-link=George Andrews (mathematician) , editor2-first=R. A. , editor2-last=Askey , editor2-link=Richard Askey , editor3-first=B. C. , editor3-last=Berndt , editor3-link=Bruce Berndt , editor4-first=K. G. , editor4-last=Ramanathan , title=Ramanujan Revisited , year=1988 , publisher=Academic Press , isbn=978-0-12-058560-1 , page
215–244
, chapter=On Highly Composite Numbers , url=https://archive.org/details/ramanujanrevisit1987rama/page/215 A survey of extremal orders, with an extensive bibliography.

Arithmetic functions