In number theory, an arithmetic, arithmetical, or number-theoretic function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that "expresses some arithmetical property of n."
An example of an arithmetic function is the non-principal character (mod 4) defined by
- where is the Kronecker symbol.
To emphasize that they are being thought of as functions rather than sequences, values of an arithmetic function are usually denoted by a(n) rather than an.
There is a larger class of number-theoretic functions that do not fit the above definition, e.g. the prime-counting functions. This article provides links to functions of both classes.
- 1 Notation
- 2 Multiplicative and additive functions
- 3 Ω(n), ω(n), νp(n) – prime power decomposition
- 4 Multiplicative functions
- 5 Completely multiplicative functions
- 6 Additive functions
- 7 Completely additive functions
- 8 Neither multiplicative nor additive
- 9 Summation functions
- 10 Dirichlet convolution
- 11 Relations among the functions
- 12 Notes
- 13 References
- 14 External links
and mean that the sum or product is over all prime numbers:
Similarly, and mean that the sum or product is over all prime powers with strictly positive exponent (so 1 is not counted):
and mean that the sum or product is over all positive divisors of n, including 1 and n. E.g., if n = 12,
The notations can be combined: and mean that the sum or product is over all prime divisors of n. E.g., if n = 18,
and similarly and mean that the sum or product is over all prime powers dividing n. E.g., if n = 24,
Multiplicative and additive functions
An arithmetic function a is
- completely additive if a(mn) = a(m) + a(n) for all natural numbers m and n;
- completely multiplicative if a(mn) = a(m)a(n) for all natural numbers m and n;
Then an arithmetic function a is
- additive if a(mn) = a(m) + a(n) for all coprime natural numbers m and n;
- multiplicative if a(mn) = a(m)a(n) for all coprime natural numbers m and n.
Ω(n), ω(n), νp(n) – prime power decomposition
The fundamental theorem of arithmetic states that any positive integer n can be represented uniquely as a product of powers of primes: where p1 < p2 < ... < pk are primes and the aj are positive integers. (1 is given by the empty product.)
It is often convenient to write this as an infinite product over all the primes, where all but a finite number have a zero exponent. Define νp(n) as the exponent of the highest power of the prime p that divides n. I.e. if p is one of the pi then νp(n) = ai, otherwise it is zero. Then
In terms of the above the functions ω and Ω are defined by
- ω(n) = k,
- Ω(n) = a1 + a2 + ... + ak.
To avoid repetition, whenever possible formulas for the functions listed in this article are given in terms of n and the corresponding pi, ai, ω, and Ω.
σk(n), τ(n), d(n) – divisor sums
σk(n) is the sum of the kth powers of the positive divisors of n, including 1 and n, where k is a complex number.
σ1(n), the sum of the (positive) divisors of n, is usually denoted by σ(n).
Since a positive number to the zero power is one, σ0(n) is therefore the number of (positive) divisors of n; it is usually denoted by d(n) or τ(n) (for the German Teiler = divisors).
Setting k = 0 in the second product gives
φ(n) – Euler totient function
φ(n), the Euler totient function, is the number of positive integers not greater than n that are coprime to n.
Jk(n) – Jordan totient function
Jk(n), the Jordan totient function, is the number of k-tuples of positive integers all less than or equal to n that form a coprime (k + 1)-tuple together with n. It is a generalization of Euler's totient, φ(n) = J1(n).
μ(n) - Möbius function
This implies that μ(1) = 1. (Because Ω(1) = ω(1) = 0.)
τ(n) – Ramanujan tau function
Although it is hard to say exactly what "arithmetical property of n" it "expresses", (τ(n) is (2π)−12 times the nth Fourier coefficient in the q-expansion of the modular discriminant function) it is included among the arithmetical functions because it is multiplicative and it occurs in identities involving certain σk(n) and rk(n) functions (because these are also coefficients in the expansion of modular forms).
cq(n) – Ramanujan's sum
Even though it is defined as a sum of complex numbers (irrational for most values of q), it is an integer. For a fixed value of n it is multiplicative in q:
- If q and r are coprime,
Many of the functions mentioned in this article have expansions as series involving these sums; see the article Ramanujan's sum for examples.
Completely multiplicative functions
λ(n) – Liouville function
λ(n), the Liouville function, is defined by
χ(n) – characters
All Dirichlet characters χ(n) are completely multiplicative. An example is the non-principal character (mod 4) defined in the introduction. Two characters have special notations:
The principal character (mod n) is denoted by χ0(a) (or χ1(a)). It is defined as
The quadratic character (mod n) is denoted by the Jacobi symbol for odd n (it is not defined for even n.):
In this formula is the Legendre symbol, defined for all integers a and all odd primes p by
Following the normal convention for the empty product,
ω(n) – distinct prime divisors
ω(n), defined above as the number of distinct primes dividing n, is additive
Completely additive functions
Ω(n) – prime divisors
Ω(n), defined above as the number of prime factors of n counted with multiplicities, is completely additive.
νp(n) – prime power dividing n
For a fixed prime p, νp(n), defined above as the exponent of the largest power of p dividing n, is completely additive.
Neither multiplicative nor additive
π(x), Π(x), θ(x), ψ(x) – prime count functions
Unlike the other functions listed in this article, these are defined for non-negative real (not just integer) arguments. They are used in the statement and proof of the prime number theorem.
π(x), the prime counting function, is the number of primes not exceeding x.
A related function counts prime powers with weight 1 for primes, 1/2 for their squares, 1/3 for cubes, ...
θ(x) and ψ(x), the Chebyshev functions are defined as sums of the natural logarithms of the primes not exceeding x:
Λ(n) – von Mangoldt function
Λ(n), the von Mangoldt function, is 0 unless the argument is a prime power, in which case it is the natural log of the prime:
p(n) – partition function
p(n), the partition function, is the number of ways of representing n as a sum of positive integers, where two representations with the same summands in a different order are not counted as being different:
λ(n) – Carmichael function
λ(n), the Carmichael function, is the smallest positive number such that for all a coprime to n. Equivalently, it is the least common multiple of the orders of the elements of the multiplicative group of integers modulo n.
For powers of odd primes and for 2 and 4, λ(n) is equal to the Euler totient function of n; for powers of 2 greater than 4 it is equal to one half of the Euler totient function of n:
and for general n it is the least common multiple of λ of each of the prime power factors of n:
h(n) – Class number
h(n), the class number function, is the order of the ideal class group of an algebraic extension of the rationals with discriminant n. The notation is ambiguous, as there are in general many extensions with the same discriminant. See quadratic field and cyclotomic field for classical examples.
rk(n) – Sum of k squares
rk(n) is the number of ways n can be represented as the sum of k squares, where representations that differ only in the order of the summands or in the signs of the square roots are counted as different.
Given an arithmetic function a(n), its summation function A(x) is defined by
Since such functions are often represented by series and integrals, to achieve pointwise convergence it is usual to define the value at the discontinuities as the average of the values to the left and right:
Individual values of arithmetic functions may fluctuate wildly – as in most of the above examples. Summation functions "smooth out" these fluctuations. In some cases it may be possible to find asymptotic behaviour for the summation function for large x.
The average order of an arithmetic function is some simpler or better-understood function which has the same summation function asmyptotically, and hence takes the same values "on average". We say that the average order of f is g if
as x tends to infinity. The example above shows that d(n) has the average order log(n).
The generating function of the Möbius function is the inverse of the zeta function:
Consider two arithmetic functions a and b and their respective generating functions Fa(s) and Fb(s). The product Fa(s)Fb(s) can be computed as follows:
It is a straightforward exercise to show that if c(n) is defined by
This function c is called the Dirichlet convolution of a and b, and is denoted by .
A particularly important case is convolution with the constant function a(n) = 1 for all n, corresponding to multiplying the generating function by the zeta function:
Multiplying by the inverse of the zeta function gives the Möbius inversion formula:
If f is multiplicative, then so is g. If f is completely multiplicative, then g is multiplicative, but may or may not be completely multiplicative. The article multiplicative function has a short proof.
Relations among the functions
There are a great many formulas connecting arithmetical functions with each other and with the functions of analysis, especially powers, roots, and the exponential and log functions.
Here are a few examples:
- where λ is the Liouville function. 
- Möbius inversion
- Möbius inversion
- Möbius inversion
- Möbius inversion
- Möbius inversion
- where λ is the Liouville function.
- Möbius inversion
Sums of squares
- where χ is the non-principal character (mod 4) defined in the introduction.
There is a formula for r3 in the section on class numbers below.
Define the function σk*(n) as
That is, if n is odd, σk*(n) is the sum of the kth powers of the divisors of n, i.e. σk(n), and if n is even it is the sum of the kth powers of the even divisors of n minus the sum of the kth powers of the odd divisors of n.
Adopt the convention that Ramanujan's τ(x) = 0 if x is not an integer.
Divisor sum convolutions
Here "convolution" does not mean "Dirichlet convolution" but instead refers to the formula for the coefficients of the product of two power series:
Extend the domain of the partition function by setting p(0) = 1.
-  This recurrence can be used to compute p(n).
An integer D is called a fundamental discriminant if it is the discriminant of a quadratic number field. This is equivalent to D ≠ 1 and either a) D is squarefree and D ≡ 1 (mod 4) or b) D ≡ 0 (mod 4), D/4 is squarefree, and D/4 ≡ 2 or 3 (mod 4).
Extend the Jacobi symbol to accept even numbers in the "denominator" by defining the Kronecker symbol:
There is also a formula relating r3 and h. Again, let D be a fundamental discriminant, D < −4. Then
Let be the nth harmonic number. Then
The Riemann hypothesis is also equivalent to the statement that, for all n > 5040,
In 1965 P. Kesava Menon proved
This has been generalized by a number of mathematicians, e.g.:
where a1, a2, ..., as are integers, gcd(a1, a2, ..., as, n) = 1.
where m1 and m2 are odd, m = lcm(m1, m2).
where * stands for Dirichlet convolution.
Let m and n be distinct, odd, and positive. Then the Jacobi symbol satisfies the Law of Quadratic Reciprocity:
-  Compare this with 13 + 23 + 33 + ... + n3 = (1 + 2 + 3 + ... + n)2
- where τ(n) is Ramanujan's function. 
- Long (1972, p. 151)
- Pettofrezzo & Byrkit (1970, p. 58)
- Hardy & Wright, intro. to Ch. XVI
- Hardy, Ramanujan, § 10.2
- Apostol, Modular Functions ..., § 1.15, Ch. 4, and ch. 6
- Hardy & Wright, §§ 18.1–18.2
- Gérald Tenenbaum (1995). Introduction to Analytic and Probabilistic Number Theory. Cambridge studies in advanced mathematics 46. Cambridge University Press. pp. 36–55. ISBN 0-521-41261-7.
- Hardy & Wright, § 17.6, show how the theory of generating functions can be constructed in a purely formal manner with no attention paid to convergence.
- Hardy & Wright, Thm. 263
- Hardy & Wright, Thm. 63
- see references at Jordan's totient function
- Holden et al in external links The formula is Gegenbauer's
- Hardy & Wright, Thm. 288–290
- Dineva in external links, prop. 4
- Hardy & Wright, Thm. 264
- Hardy & Wright, Thm. 296
- Hardy & Wright, Thm. 278
- Hardy & Wright, Thm. 386
- Hardy, Ramanujan, eqs 9.1.2, 9.1.3
- Koblitz, Ex. III.5.2
- Hardy & Wright, § 20.13
- Hardy, Ramanujan, § 9.7
- Hardy, Ramanujan, § 9.13
- Hardy, Ramanujan, § 9.17
- The paper by Huard, Ou, Spearman, and Williams in the external links also has proofs.
- Ramanujan, On Certain Arithmetical Functions, Table IV; Papers, p. 146
- Koblitz, ex. III.2.8
- Koblitz, ex. III.2.3
- Koblitz, ex. III.2.2
- Koblitz, ex. III.2.4
- Apostol, Modular Functions ..., Ex. 6.10
- Apostol, Modular Functions..., Ch. 6 Ex. 10
- G.H. Hardy, S. Ramannujan, Asymptotic Formulæ in Combinatory Analysis, § 1.3; in Ramannujan, Papers p. 279
- Landau, p. 168, credits Gauss as well as Dirichlet
- Cohen, Def. 5.1.2
- Cohen, Corr. 5.3.13
- see Edwards, § 9.5 exercises for more complicated formulas.
- Cohen, Prop 5.10.3
- See Divisor function.
- Hardy & Wright, eq. 22.1.2
- See prime counting functions.
- Hardy & Wright, eq. 22.1.1
- Hardy & Wright, eq. 22.1.3
- László Tóth, Menon's Identity and Arithmetical Sums ..., #External links, eq. 1
- Tóth, eq. 5
- Tóth, eq. 3
- Tóth, eq. 35
- Tóth, eq. 2
- Tóth states that Menon proved this for multiplicative f in 1965 and V. Sita Ramaiah for general f.
- Hardy Ramanujan, eq. 3.10.3
- Hardy & Wright, § 22.13
- See Multiplicative group of integers modulo n and Primitive root modulo n.
- Hardy & Wright, Thm. 329
- Hardy & Wright, Thms. 271, 272
- Hardy & Wright, eq. 16.3.1
- Ramanujan, Some Formulæ in the Analytic Theory of Numbers, eq. (C); Papers p.133. A footnote says that Hardy told Ramanujan it also appears in an 1857 paper by Liouville.
- Ramanujan, Some Formulæ in the Analytic Theory of Numbers, eq. (F); Papers p.134
- Apostol, Modular Functions ..., ch. 6 eq. 4
- Apostol, Modular Functions ..., ch. 6 eq. 3
- Tom M. Apostol (1976), Introduction to Analytic Number Theory, Springer Undergraduate Texts in Mathematics, ISBN 0-387-90163-9
- Apostol, Tom M. (1989), Modular Functions and Dirichlet Series in Number Theory (2nd Edition), New York: Springer, ISBN 0-387-97127-0
- Cohen, Henri (1993), A Course in Computational Algebraic Number Theory, Berlin: Springer, ISBN 3-540-55640-0
- Hardy, G. H. (1999), Ramanujan: Twelve Lectures on Subjects Suggested by his Life and work, Providence RI: AMS / Chelsea, ISBN 978-0-8218-2023-0
- Hardy, G. H.; Wright, E. M. (1980), An Introduction to the Theory of Numbers (Fifth edition), Oxford: Oxford University Press, ISBN 978-0-19-853171-5
- Koblitz, Neal (1984), Introduction to Elliptic Curves and Modular Forms, New York: Springer, ISBN 0-387-97966-2
- Landau, Edmund (1966), Elementary Number Theory, New York: Chelsea
- William J. LeVeque (1996), Fundamentals of Number Theory, Courier Dover Publications, ISBN 0-486-68906-9
- Long, Calvin T. (1972), Elementary Introduction to Number Theory (2nd ed.), Lexington: D. C. Heath and Company, LCCN 77-171950
- Pettofrezzo, Anthony J.; Byrkit, Donald R. (1970), Elements of Number Theory, Englewood Cliffs: Prentice Hall, LCCN 77-81766
- Hazewinkel, Michiel, ed. (2001), "Arithmetic function", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
- Matthew Holden, Michael Orrison, Michael Varble Yet another Generalization of Euler's Totient Function
- Huard, Ou, Spearman, and Williams. Elementary Evaluation of Certain Convolution Sums Involving Divisor Functions Elementary (i.e. not relying on the theory of modular forms) proofs of divisor sum convolutions, formulas for the number of ways of representing a number as a sum of triangular numbers, and related results.
- Dineva, Rosica, The Euler Totient, the Möbius, and the Divisor Functions