Normal order of an arithmetic function

In mathematics, in the field of number theory, the normal order of an arithmetic function is some simpler or better-understood function which "usually" takes the same or closely approximate values.

Let f be a function on the natural numbers. We say that the normal order of f is g if for every &epsilon > 0, the inequalities

$(1-\epsilon )g(n)\leq f(n)\leq (1+\epsilon )g(n)\,$

hold for almost all n: that is, if the proportion of n ≤ x for which this does not hold tends to 0 as x tends to infinity.

It is conventional to assume that the approximating function g is continuous and monotone.

Examples

• The Hardy–Ramanujan theorem: the normal order of ω(n), the number of distinct prime factors of n, is log(log(n));
• The normal order of log(d(n)), where d(n) is the number of divisors of n, is log(2) log log(n).

References

• G.H. Hardy (1917). "The normal number of prime factors of a number". Quart. J. Math. 48: 76–92. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
• G.H. Hardy (1979). An Introduction to the Theory of Numbers (5th ed. ed.). Oxford University Press. p. 356. ISBN 0-19-853171-0. {{cite book}}: |edition= has extra text (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)
• Gerald Tenenbaum (1995). Introduction to Analytic and Probabilistic Number Theory. Cambridge University Press. p. 299. ISBN 0-521-41261-7.

External links

• Weisstein, Eric W. "Normal Order". MathWorld.