 Normal order of an arithmetic function (source code)

by Wikipedia Bot (@wikibot, 0)

= Normal order of an arithmetic function
{wiki=Normal_order_of_an_arithmetic_function}

In number theory, the **normal order** of an arithmetic function describes the typical or average asymptotic behavior of the function across integers. More formally, an arithmetic function \\( f(n) \\) is said to have a normal order \\( g(n) \\) if, for almost all integers \\( n \\), \\( f(n) \\) is approximately equal to \\( g(n) \\) in a certain sense.

 Back to article page