Average order of an arithmetic function

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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

Let be an arithmetic function. We say that an average order of is if

as tends to infinity.

It is conventional to choose an approximating function that is continuous and monotone. But even so an average order is of course not unique.

In cases where the limit

exists, it is said that has a mean value (average value) .


  • An average order of d (n), the number of divisors of n, is log n;
  • An average order of σ (n), the sum of divisors of n, is n π2 / 6;
  • An average order of φ (n), Euler's totient function of n, is 6 n / π2;
  • An average order of r (n), the number of ways of expressing n as a sum of two squares, is π n;
  • The average order of representations of a natural number as a sum of three squares is 4π n / 3;
  • The average number of decompositions of a natural number into a sum of one or more consecutive prime numbers is n log 2;
  • An average order of ω (n), the number of distinct prime factors of n, is log log n;
  • An average order of Ω (n), the number of prime factors of n, is log log n;
  • The prime number theorem is equivalent to the statement that the von Mangoldt function Λ (n) has average order 1;
  • An average order of μ (n), the Möbius function, is zero; this is again equivalent to the prime number theorem.

Calculating mean values using Dirichlet series[edit]

In case is of the form

for some arithmetic function , one has,

This identity often provides a practical way to calculate the mean value in terms of the Riemann zeta function. This is illustrated in the following example.

The density of the k-th power free integers in N[edit]

For an integer the set of k-th-power-free integers is

We calculate the natural density of these numbers in N, that is, the average value of , denoted by , in terms of the zeta function.

The function is multiplicative, and since it is bounded by 1, its Dirichlet series converges absolutely in the half-plane , and there has Euler product

By the Möbius inversion formula, we get

where stands for the Möbius function. Equivalently,


and hence,

By comparing the coefficients, we get

Using (1), we get

We conclude that,

where for this we used the relation

which follows from the Möbius inversion formula.

In particular, the density of the square-free integers is .

Visibility of lattice points[edit]

We say that two lattice points are visible from one another if there is no lattice point on the open line segment joining them.

Now, if gcd(a, b) = d > 1, then writing a = da2, b = db2 one observes that the point (a2, b2) is on the line segment which joins (0,0) to (a, b) and hence (a, b) is not visible from the origin. Thus (a, b) is visible from the origin implies that (a, b) = 1. Conversely, it is also easy to see that gcd(a, b) = 1 implies that there is no other integer lattice point in the segment joining (0,0) to (a,b). Thus, (a, b) is visible from (0,0) if and only if gcd(a, b) = 1.

Notice that is the probability of a random point on the square to be visible from the origin.

Thus, one can show that the natural density of the points which are visible from the origin is given by the average,

interestingly, is also the natural density of the square-free numbers in N. In fact, this is not a coincidence. Consider the k-dimensional lattice, . The natural density of the points which are visible from the origin is , which is also the natural density of the k-th free integers in N.

Divisor functions[edit]

Consider the generalization of :

The following are true:

where .

Better average order[edit]

This notion is best discussed through an example. From

( is the Euler–Mascheroni constant) and

we have the asymptotic relation

which suggests that the function is a better choice of average order for than simply .

Mean values over Fq[x][edit]


Let h(x) be a function on the set of monic polynomials over Fq. For we define

This is the mean value (average value) of h on the set of monic polynomials of degree n. We say that g(n) is an average order of h if

as n tends to infinity.

In cases where the limit,

exists, it is said that h has a mean value (average value) c.

Zeta function and Dirichlet series in Fq[X][edit]

Let Fq[X]=A be the ring of polynomials over the finite field Fq.

Let h be a polynomial arithmetic function (i.e. a function on set of monic polynomials over A). Its corresponding Dirichlet series define to be

where for , set if , and otherwise.

The polynomial zeta function is then

Similar to the situation in N, every Dirichlet series of a multiplicative function h has a product representation (Euler product):

Where the product runs over all monic irreducible polynomials P.

For example, the product representation of the zeta function is as for the integers: .

Unlike the classical zeta function, is a simple rational function:

In a similar way, If ƒ and g are two polynomial arithmetic functions, one defines ƒ * g, the Dirichlet convolution of ƒ and g, by

where the sum extends over all monic divisors d of m, or equivalently over all pairs (a, b) of monic polynomials whose product is m. The identity still holds. Thus, like in the elementary theory, the polynomial Dirichlet series and the zeta function has a connection with the notion of mean values in the context of polynomials. The following examples illustrate it.


The density of the k-th power free polynomials in Fq[X][edit]

Define to be 1 if is k-th power free and 0 otherwise.

We calculate the average value of , which is the density of the k-th power free polynomials in Fq[X], in the same fashion as in the integers.

By multiplicativity of :

Denote the number of k-th power monic polynomials of degree n, we get

Making the substitution we get:

Finally, expand the left-hand side in a geometric series and compare the coefficients on on both sides, to conclude that


And since it doesn't depend on n this is also the mean value of .

Polynomial Divisor functions[edit]

In Fq[X], we define

We will compute for .

First, notice that

where and .


Substitute we get,

, and by Cauchy product we get,

Finally we get that,

Notice that

Thus, if we set then the above result reads

which resembles the analogous result for the integers:

Number of divisors[edit]

Let be the number of monic divisors of f and let be the sum of over all monics of degree n.

where .

Expanding the right-hand side into power series we get,

Substitute the above equation becomes:

which resembles closely the analogous result for integers , where is Euler constant.

It is interesting to note that not a lot is known about the error term for the integers, while in the polynomials case, there is no error term! This is because of the very simple nature of the zeta function , and that it has NO zeros.

Polynomial von Mangoldt function[edit]

The Polynomial von Mangoldt function is defined by:

Where the logarithm is taken on the basis of q.

Proposition. The mean value of is exactly 1.

Proof. Let m be a monic polynomial, and let be the prime decomposition of m.

We have,


and we get that,



We got that:



and by dividing by we get that,

Polynomial Euler totient function[edit]

Define Euler totient function polynomial analogue, , to be the number of elements in the group . We have,

See also[edit]