Average order of an arithmetic function

From Citizendium
Revision as of 07:27, 19 December 2011 by imported>David Finn
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
Main Article
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
This editable Main Article is under development and subject to a disclaimer.

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

Let f be a function on the natural numbers. We say that the average order of f is g if

as x tends to infinity.

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