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 f be an arithmetic function. We say that an average order of f is g if as x tends to infinity. It is conventional to choose an approximating function g 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 f has a mean value (average value) c. If in addition the constant c is not zero, then the constant function g(x)=c is an average order of f.

Examples

d(n) , the number of divisors of n , is log n σ(n) , the sum of divisors of n , is nπ26 φ(n) , Euler's totient function of n , is 6nπ2 r(n) , the number of ways of expressing n as a sum of two squares, is π 4πn3 n log2 ω(n) , the number of distinct prime factors of n , is loglog n Ω(n) , the number of prime factors of n , is loglog n Λ(n) has average order 1; μ(n) , the Möbius function, is zero; this is again equivalent to the prime number theorem.

Calculating mean values using Dirichlet series

In case F is of the form for some arithmetic function f(n), one has, Generalized identities of the previous form are found here. 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 kth-power-free integers in

For an integer k \geq 1 the set Q_k of kth-power-free integers is We calculate the natural density of these numbers in, that is, the average value of 1 {Q k}, denoted by \delta(n), in terms of the zeta function. The function \delta 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 \mu stands for the Möbius function. Equivalently, where and hence, By comparing the coefficients, we get Using, 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

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, is also the natural density of the square-free numbers in. 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.

Divisor functions

Consider the generalization of d(n): The following are true: where.

Better average order

This notion is best discussed through an example. From (\gamma is the Euler–Mascheroni constant) and we have the asymptotic relation which suggests that the function is a better choice of average order for d(n) than simply \log n.

Mean values over

F{{sub|q}}[x]

Definition

Let h(x) be a function on the set of monic polynomials over Fq. For n\ge 1 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

F{{sub|q}}[X] 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 g\in A, set if g\ne 0, and |g|=0 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 f and g are two polynomial arithmetic functions, one defines f * g, the Dirichlet convolution of f 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.

Examples

The density of the k-th power free polynomials in

F{{sub|q}}[X] Define \delta(f) to be 1 if f is k-th power free and 0 otherwise. We calculate the average value of \delta, 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 \delta: Denote b_n the number of k-th power monic polynomials of degree n, we get Making the substitution u=q^{-s} we get: Finally, expand the left-hand side in a geometric series and compare the coefficients on u^{n} on both sides, to conclude that Hence, And since it doesn't depend on n this is also the mean value of \delta(f).

Polynomial Divisor functions

In Fq[X] , we define We will compute for k\ge 1. First, notice that where and. Therefore, Substitute q^{-s}=u we get, and by Cauchy product we get, Finally we get that, Notice that Thus, if we set x=q^n then the above result reads which resembles the analogous result for the integers:

Number of divisors

Let d(f) be the number of monic divisors of f and let D(n) be the sum of d(f) over all monics of degree n. where u=q^{-s}. Expanding the right-hand side into power series we get, Substitute x=q^n the above equation becomes: which resembles closely the analogous result for integers, where \gamma is Euler constant. Not much 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

The Polynomial von Mangoldt function is defined by: where the logarithm is taken on the basis of q. Proposition. The mean value of \Lambda_{A} is exactly 1. Proof. Let m be a monic polynomial, and let be the prime decomposition of m. We have, Hence, and we get that, Now, Thus, We got that: Now, Hence, and by dividing by q^n we get that,

Polynomial Euler totient function

Define Euler totient function polynomial analogue, \Phi, to be the number of elements in the group (A/fA)^{*}. We have,