• Source: Arithmetic function

In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes.
An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n.
Arithmetic functions are often extremely irregular (see table), but some of them have series expansions in terms of Ramanujan's sum.




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;
Two whole numbers m and n are called coprime if their greatest common divisor is 1, that is, if there is no prime number that divides both of them.
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.




Notation


In this article,




∑

p


f
(
p
)


{\textstyle \sum _{p}f(p)}

and




∏

p


f
(
p
)


{\textstyle \prod _{p}f(p)}

mean that the sum or product is over all prime numbers:





∑

p


f
(
p
)
=
f
(
2
)
+
f
(
3
)
+
f
(
5
)
+
⋯


{\displaystyle \sum _{p}f(p)=f(2)+f(3)+f(5)+\cdots }


and





∏

p


f
(
p
)
=
f
(
2
)
f
(
3
)
f
(
5
)
⋯
.


{\displaystyle \prod _{p}f(p)=f(2)f(3)f(5)\cdots .}


Similarly,




∑


p

k




f
(

p

k


)


{\textstyle \sum _{p^{k}}f(p^{k})}

and




∏


p

k




f
(

p

k


)


{\textstyle \prod _{p^{k}}f(p^{k})}

mean that the sum or product is over all prime powers with strictly positive exponent (so k = 0 is not included):





∑


p

k




f
(

p

k


)
=

∑

p



∑

k
>
0


f
(

p

k


)
=
f
(
2
)
+
f
(
3
)
+
f
(
4
)
+
f
(
5
)
+
f
(
7
)
+
f
(
8
)
+
f
(
9
)
+
⋯
.


{\displaystyle \sum _{p^{k}}f(p^{k})=\sum _{p}\sum _{k>0}f(p^{k})=f(2)+f(3)+f(4)+f(5)+f(7)+f(8)+f(9)+\cdots .}


The notations




∑

d
∣
n


f
(
d
)


{\textstyle \sum _{d\mid n}f(d)}

and




∏

d
∣
n


f
(
d
)


{\textstyle \prod _{d\mid n}f(d)}

mean that the sum or product is over all positive divisors of n, including 1 and n. For example, if n = 12, then





∏

d
∣
12


f
(
d
)
=
f
(
1
)
f
(
2
)
f
(
3
)
f
(
4
)
f
(
6
)
f
(
12
)
.


{\displaystyle \prod _{d\mid 12}f(d)=f(1)f(2)f(3)f(4)f(6)f(12).}


The notations can be combined:




∑

p
∣
n


f
(
p
)


{\textstyle \sum _{p\mid n}f(p)}

and




∏

p
∣
n


f
(
p
)


{\textstyle \prod _{p\mid n}f(p)}

mean that the sum or product is over all prime divisors of n. For example, if n = 18, then





∑

p
∣
18


f
(
p
)
=
f
(
2
)
+
f
(
3
)
,


{\displaystyle \sum _{p\mid 18}f(p)=f(2)+f(3),}


and similarly




∑


p

k


∣
n


f
(

p

k


)


{\textstyle \sum _{p^{k}\mid n}f(p^{k})}

and




∏


p

k


∣
n


f
(

p

k


)


{\textstyle \prod _{p^{k}\mid n}f(p^{k})}

mean that the sum or product is over all prime powers dividing n. For example, if n = 24, then





∏


p

k


∣
24


f
(

p

k


)
=
f
(
2
)
f
(
3
)
f
(
4
)
f
(
8
)
.


{\displaystyle \prod _{p^{k}\mid 24}f(p^{k})=f(2)f(3)f(4)f(8).}





Ω(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:



n
=

p

1



a

1




⋯

p

k



a

k






{\displaystyle n=p_{1}^{a_{1}}\cdots p_{k}^{a_{k}}}

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 the p-adic valuation νp(n) to be the exponent of the highest power of the prime p that divides n. That is, if p is one of the pi then νp(n) = ai, otherwise it is zero. Then




n
=

∏

p



p


ν

p


(
n
)


.


{\displaystyle n=\prod _{p}p^{\nu _{p}(n)}.}


In terms of the above the prime omega functions ω and Ω are defined by

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 Ω.




Multiplicative functions






= σ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).





σ

k


(
n
)
=

∏

i
=
1


ω
(
n
)






p

i


(

a

i


+
1
)
k


−
1



p

i


k


−
1



=

∏

i
=
1


ω
(
n
)



(

1
+

p

i


k


+

p

i


2
k


+
⋯
+

p

i



a

i


k



)

.


{\displaystyle \sigma _{k}(n)=\prod _{i=1}^{\omega (n)}{\frac {p_{i}^{(a_{i}+1)k}-1}{p_{i}^{k}-1}}=\prod _{i=1}^{\omega (n)}\left(1+p_{i}^{k}+p_{i}^{2k}+\cdots +p_{i}^{a_{i}k}\right).}


Setting k = 0 in the second product gives




τ
(
n
)
=
d
(
n
)
=
(
1
+

a

1


)
(
1
+

a

2


)
⋯
(
1
+

a

ω
(
n
)


)
.


{\displaystyle \tau (n)=d(n)=(1+a_{1})(1+a_{2})\cdots (1+a_{\omega (n)}).}





= φ(n) – Euler totient function

=
φ(n), the Euler totient function, is the number of positive integers not greater than n that are coprime to n.




φ
(
n
)
=
n

∏

p
∣
n



(

1
−


1
p



)

=
n

(




p

1


−
1


p

1




)


(




p

2


−
1


p

2




)

⋯

(




p

ω
(
n
)


−
1


p

ω
(
n
)




)

.


{\displaystyle \varphi (n)=n\prod _{p\mid n}\left(1-{\frac {1}{p}}\right)=n\left({\frac {p_{1}-1}{p_{1}}}\right)\left({\frac {p_{2}-1}{p_{2}}}\right)\cdots \left({\frac {p_{\omega (n)}-1}{p_{\omega (n)}}}\right).}





= 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).





J

k


(
n
)
=

n

k



∏

p
∣
n



(

1
−


1

p

k





)

=

n

k



(




p

1


k


−
1


p

1


k




)


(




p

2


k


−
1


p

2


k




)

⋯

(




p

ω
(
n
)


k


−
1


p

ω
(
n
)


k




)

.


{\displaystyle J_{k}(n)=n^{k}\prod _{p\mid n}\left(1-{\frac {1}{p^{k}}}\right)=n^{k}\left({\frac {p_{1}^{k}-1}{p_{1}^{k}}}\right)\left({\frac {p_{2}^{k}-1}{p_{2}^{k}}}\right)\cdots \left({\frac {p_{\omega (n)}^{k}-1}{p_{\omega (n)}^{k}}}\right).}





= μ(n) – Möbius function

=
μ(n), the Möbius function, is important because of the Möbius inversion formula. See Dirichlet convolution, below.




μ
(
n
)
=


{



(
−
1

)

ω
(
n
)


=
(
−
1

)

Ω
(
n
)





if


ω
(
n
)
=
Ω
(
n
)




0



if


ω
(
n
)
≠
Ω
(
n
)
.








{\displaystyle \mu (n)={\begin{cases}(-1)^{\omega (n)}=(-1)^{\Omega (n)}&{\text{if }}\;\omega (n)=\Omega (n)\\0&{\text{if }}\;\omega (n)\neq \Omega (n).\end{cases}}}


This implies that μ(1) = 1. (Because Ω(1) = ω(1) = 0.)




= τ(n) – Ramanujan tau function

=
τ(n), the Ramanujan tau function, is defined by its generating function identity:





∑

n
≥
1


τ
(
n
)

q

n


=
q

∏

n
≥
1


(
1
−

q

n



)

24


.


{\displaystyle \sum _{n\geq 1}\tau (n)q^{n}=q\prod _{n\geq 1}(1-q^{n})^{24}.}


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

=
cq(n), Ramanujan's sum, is the sum of the nth powers of the primitive qth roots of unity:





c

q


(
n
)
=

∑




gcd
(
a
,
q
)
=
1


1
≤
a
≤
q






e

2
π
i



a
q



n


.


{\displaystyle c_{q}(n)=\sum _{\stackrel {1\leq a\leq q}{\gcd(a,q)=1}}e^{2\pi i{\tfrac {a}{q}}n}.}


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, then




c

q


(
n
)

c

r


(
n
)
=

c

q
r


(
n
)
.


{\displaystyle c_{q}(n)c_{r}(n)=c_{qr}(n).}





= ψ(n) - Dedekind psi function

=
The Dedekind psi function, used in the theory of modular functions, is defined by the formula




ψ
(
n
)
=
n

∏

p

|

n



(

1
+


1
p



)

.


{\displaystyle \psi (n)=n\prod _{p|n}\left(1+{\frac {1}{p}}\right).}





Completely multiplicative functions






= λ(n) – Liouville function

=
λ(n), the Liouville function, is defined by




λ
(
n
)
=
(
−
1

)

Ω
(
n
)


.


{\displaystyle \lambda (n)=(-1)^{\Omega (n)}.}





= χ(n) – characters

=
All Dirichlet characters χ(n) are completely multiplicative. Two characters have special notations:
The principal character (mod n) is denoted by χ0(a) (or χ1(a)). It is defined as





χ

0


(
a
)
=


{



1



if

gcd
(
a
,
n
)
=
1
,




0



if

gcd
(
a
,
n
)
≠
1.








{\displaystyle \chi _{0}(a)={\begin{cases}1&{\text{if }}\gcd(a,n)=1,\\0&{\text{if }}\gcd(a,n)\neq 1.\end{cases}}}


The quadratic character (mod n) is denoted by the Jacobi symbol for odd n (it is not defined for even n):





(


a
n


)

=


(


a

p

1




)



a

1






(


a

p

2




)



a

2




⋯


(


a

p

ω
(
n
)




)



a

ω
(
n
)




.


{\displaystyle \left({\frac {a}{n}}\right)=\left({\frac {a}{p_{1}}}\right)^{a_{1}}\left({\frac {a}{p_{2}}}\right)^{a_{2}}\cdots \left({\frac {a}{p_{\omega (n)}}}\right)^{a_{\omega (n)}}.}


In this formula



(



a
p



)


{\displaystyle ({\tfrac {a}{p}})}

is the Legendre symbol, defined for all integers a and all odd primes p by





(


a
p


)

=


{






0



if

a
≡
0


(
mod

p
)

,




+
1



if

a
≢
0


(
mod

p
)


and for some integer

x
,

a
≡

x

2




(
mod

p
)





−
1



if there is no such

x
.








{\displaystyle \left({\frac {a}{p}}\right)={\begin{cases}\;\;\,0&{\text{if }}a\equiv 0{\pmod {p}},\\+1&{\text{if }}a\not \equiv 0{\pmod {p}}{\text{ and for some integer }}x,\;a\equiv x^{2}{\pmod {p}}\\-1&{\text{if there is no such }}x.\end{cases}}}


Following the normal convention for the empty product,




(


a
1


)

=
1.


{\displaystyle \left({\frac {a}{1}}\right)=1.}





Additive functions






= ω(n) – distinct prime divisors

=
ω(n), defined above as the number of distinct primes dividing n, is additive (see Prime omega function).




Completely additive functions






= Ω(n) – prime divisors

=
Ω(n), defined above as the number of prime factors of n counted with multiplicities, is completely additive (see Prime omega function).




= νp(n) – p-adic valuation of an integer n

=
For a fixed prime p, νp(n), defined above as the exponent of the largest power of p dividing n, is completely additive.




= Logarithmic derivative

=




ld
⁡
(
n
)
=



D
(
n
)

n


=

∑




p

prime



p
∣
n









v

p


(
n
)

p




{\displaystyle \operatorname {ld} (n)={\frac {D(n)}{n}}=\sum _{\stackrel {p\mid n}{p{\text{ prime}}}}{\frac {v_{p}(n)}{p}}}

, where



D
(
n
)


{\displaystyle D(n)}

is the arithmetic derivative.




Neither multiplicative nor additive






= π(x), Π(x), ϑ(x), ψ(x) – prime-counting functions

=
These important functions (which are not arithmetic functions) are defined for non-negative real arguments, and are used in the various statements and proofs of the prime number theorem. They are summation functions (see the main section just below) of arithmetic functions which are neither multiplicative nor additive.
π(x), the prime-counting function, is the number of primes not exceeding x. It is the summation function of the characteristic function of the prime numbers.




π
(
x
)
=

∑

p
≤
x


1


{\displaystyle \pi (x)=\sum _{p\leq x}1}


A related function counts prime powers with weight 1 for primes, 1/2 for their squares, 1/3 for cubes, etc. It is the summation function of the arithmetic function which takes the value 1/k on integers which are the k-th power of some prime number, and the value 0 on other integers.




Π
(
x
)
=

∑


p

k


≤
x




1
k


.


{\displaystyle \Pi (x)=\sum _{p^{k}\leq x}{\frac {1}{k}}.}


ϑ(x) and ψ(x), the Chebyshev functions, are defined as sums of the natural logarithms of the primes not exceeding x.




ϑ
(
x
)
=

∑

p
≤
x


log
⁡
p
,


{\displaystyle \vartheta (x)=\sum _{p\leq x}\log p,}





ψ
(
x
)
=

∑


p

k


≤
x


log
⁡
p
.


{\displaystyle \psi (x)=\sum _{p^{k}\leq x}\log p.}


The second Chebyshev function ψ(x) is the summation function of the von Mangoldt function just below.




= Λ(n) – von Mangoldt function

=
Λ(n), the von Mangoldt function, is 0 unless the argument n is a prime power pk, in which case it is the natural log of the prime p:




Λ
(
n
)
=


{



log
⁡
p



if

n
=
2
,
3
,
4
,
5
,
7
,
8
,
9
,
11
,
13
,
16
,
…
=

p

k



is a prime power





0



if

n
=
1
,
6
,
10
,
12
,
14
,
15
,
18
,
20
,
21
,
…





is not a prime power

.








{\displaystyle \Lambda (n)={\begin{cases}\log p&{\text{if }}n=2,3,4,5,7,8,9,11,13,16,\ldots =p^{k}{\text{ is a prime power}}\\0&{\text{if }}n=1,6,10,12,14,15,18,20,21,\dots \;\;\;\;{\text{ is not a prime power}}.\end{cases}}}





= 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:




p
(
n
)
=

|

{

(

a

1


,

a

2


,
…

a

k


)
:
0
<

a

1


≤

a

2


≤
⋯
≤

a

k



∧

n
=

a

1


+

a

2


+
⋯
+

a

k



}

|

.


{\displaystyle p(n)=\left|\left\{(a_{1},a_{2},\dots a_{k}):0




= λ(n) – Carmichael function

=
λ(n), the Carmichael function, is the smallest positive number such that




a

λ
(
n
)


≡
1


(
mod

n
)



{\displaystyle a^{\lambda (n)}\equiv 1{\pmod {n}}}

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:




λ
(
n
)
=


{





ϕ
(
n
)



if

n
=
2
,
3
,
4
,
5
,
7
,
9
,
11
,
13
,
17
,
19
,
23
,
25
,
27
,
…







1
2



ϕ
(
n
)



if

n
=
8
,
16
,
32
,
64
,
…








{\displaystyle \lambda (n)={\begin{cases}\;\;\phi (n)&{\text{if }}n=2,3,4,5,7,9,11,13,17,19,23,25,27,\dots \\{\tfrac {1}{2}}\phi (n)&{\text{if }}n=8,16,32,64,\dots \end{cases}}}


and for general n it is the least common multiple of λ of each of the prime power factors of n:




λ
(

p

1



a

1





p

2



a

2




…

p

ω
(
n
)



a

ω
(
n
)




)
=
lcm
⁡
[
λ
(

p

1



a

1




)
,

λ
(

p

2



a

2




)
,
…
,
λ
(

p

ω
(
n
)



a

ω
(
n
)




)
]
.


{\displaystyle \lambda (p_{1}^{a_{1}}p_{2}^{a_{2}}\dots p_{\omega (n)}^{a_{\omega (n)}})=\operatorname {lcm} [\lambda (p_{1}^{a_{1}}),\;\lambda (p_{2}^{a_{2}}),\dots ,\lambda (p_{\omega (n)}^{a_{\omega (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.





r

k


(
n
)
=

|

{

(

a

1


,

a

2


,
…
,

a

k


)
:
n
=

a

1


2


+

a

2


2


+
⋯
+

a

k


2



}

|



{\displaystyle r_{k}(n)=\left|\left\{(a_{1},a_{2},\dots ,a_{k}):n=a_{1}^{2}+a_{2}^{2}+\cdots +a_{k}^{2}\right\}\right|}





= D(n) – Arithmetic derivative

=
Using the Heaviside notation for the derivative, the arithmetic derivative D(n) is a function such that




D
(
n
)
=
1


{\displaystyle D(n)=1}

if n prime, and




D
(
m
n
)
=
m
D
(
n
)
+
D
(
m
)
n


{\displaystyle D(mn)=mD(n)+D(m)n}

(the product rule)




Summation functions


Given an arithmetic function a(n), its summation function A(x) is defined by




A
(
x
)
:=

∑

n
≤
x


a
(
n
)
.


{\displaystyle A(x):=\sum _{n\leq x}a(n).}


A can be regarded as a function of a real variable. Given a positive integer m, A is constant along open intervals m < x < m + 1, and has a jump discontinuity at each integer for which a(m) ≠ 0.
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:





A

0


(
m
)
:=


1
2



(


∑

n
<
m


a
(
n
)
+

∑

n
≤
m


a
(
n
)

)

=
A
(
m
)
−


1
2


a
(
m
)
.


{\displaystyle A_{0}(m):={\frac {1}{2}}\left(\sum _{n

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.
A classical example of this phenomenon is given by the divisor summatory function, the summation function of d(n), the number of divisors of n:





lim inf

n
→
∞


d
(
n
)
=
2


{\displaystyle \liminf _{n\to \infty }d(n)=2}






lim sup

n
→
∞





log
⁡
d
(
n
)
log
⁡
log
⁡
n


log
⁡
n



=
log
⁡
2


{\displaystyle \limsup _{n\to \infty }{\frac {\log d(n)\log \log n}{\log n}}=\log 2}






lim

n
→
∞





d
(
1
)
+
d
(
2
)
+
⋯
+
d
(
n
)


log
⁡
(
1
)
+
log
⁡
(
2
)
+
⋯
+
log
⁡
(
n
)



=
1.


{\displaystyle \lim _{n\to \infty }{\frac {d(1)+d(2)+\cdots +d(n)}{\log(1)+\log(2)+\cdots +\log(n)}}=1.}


An average order of an arithmetic function is some simpler or better-understood function which has the same summation function asymptotically, and hence takes the same values "on average". We say that g is an average order of f if





∑

n
≤
x


f
(
n
)
∼

∑

n
≤
x


g
(
n
)


{\displaystyle \sum _{n\leq x}f(n)\sim \sum _{n\leq x}g(n)}


as x tends to infinity. The example above shows that d(n) has the average order log(n).




Dirichlet convolution


Given an arithmetic function a(n), let Fa(s), for complex s, be the function defined by the corresponding Dirichlet series (where it converges):





F

a


(
s
)
:=

∑

n
=
1


∞





a
(
n
)


n

s




.


{\displaystyle F_{a}(s):=\sum _{n=1}^{\infty }{\frac {a(n)}{n^{s}}}.}


Fa(s) is called a generating function of a(n). The simplest such series, corresponding to the constant function a(n) = 1 for all n, is ζ(s) the Riemann zeta function.
The generating function of the Möbius function is the inverse of the zeta function:




ζ
(
s
)


∑

n
=
1


∞





μ
(
n
)


n

s




=
1
,


ℜ
s
>
1.


{\displaystyle \zeta (s)\,\sum _{n=1}^{\infty }{\frac {\mu (n)}{n^{s}}}=1,\;\;\Re s>1.}


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:





F

a


(
s
)

F

b


(
s
)
=

(


∑

m
=
1


∞





a
(
m
)


m

s





)


(


∑

n
=
1


∞





b
(
n
)


n

s





)

.


{\displaystyle F_{a}(s)F_{b}(s)=\left(\sum _{m=1}^{\infty }{\frac {a(m)}{m^{s}}}\right)\left(\sum _{n=1}^{\infty }{\frac {b(n)}{n^{s}}}\right).}


It is a straightforward exercise to show that if c(n) is defined by




c
(
n
)
:=

∑

i
j
=
n


a
(
i
)
b
(
j
)
=

∑

i
∣
n


a
(
i
)
b

(


n
i


)

,


{\displaystyle c(n):=\sum _{ij=n}a(i)b(j)=\sum _{i\mid n}a(i)b\left({\frac {n}{i}}\right),}


then




F

c


(
s
)
=

F

a


(
s
)

F

b


(
s
)
.


{\displaystyle F_{c}(s)=F_{a}(s)F_{b}(s).}


This function c is called the Dirichlet convolution of a and b, and is denoted by



a
∗
b


{\displaystyle a*b}

.
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:




g
(
n
)
=

∑

d
∣
n


f
(
d
)
.


{\displaystyle g(n)=\sum _{d\mid n}f(d).}


Multiplying by the inverse of the zeta function gives the Möbius inversion formula:




f
(
n
)
=

∑

d
∣
n


μ

(


n
d


)

g
(
d
)
.


{\displaystyle f(n)=\sum _{d\mid n}\mu \left({\frac {n}{d}}\right)g(d).}


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.




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. The page divisor sum identities contains many more generalized and related examples of identities involving arithmetic functions.
Here are a few examples:




= Dirichlet convolutions

=





∑

δ
∣
n


μ
(
δ
)
=

∑

δ
∣
n


λ

(


n
δ


)


|

μ
(
δ
)

|

=


{



1



if

n
=
1




0



if

n
≠
1








{\displaystyle \sum _{\delta \mid n}\mu (\delta )=\sum _{\delta \mid n}\lambda \left({\frac {n}{\delta }}\right)|\mu (\delta )|={\begin{cases}1&{\text{if }}n=1\\0&{\text{if }}n\neq 1\end{cases}}}

where λ is the Liouville function.





∑

δ
∣
n


φ
(
δ
)
=
n
.


{\displaystyle \sum _{\delta \mid n}\varphi (\delta )=n.}






φ
(
n
)
=

∑

δ
∣
n


μ

(


n
δ


)

δ
=
n

∑

δ
∣
n





μ
(
δ
)

δ


.


{\displaystyle \varphi (n)=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)\delta =n\sum _{\delta \mid n}{\frac {\mu (\delta )}{\delta }}.}

Möbius inversion





∑

d
∣
n



J

k


(
d
)
=

n

k


.


{\displaystyle \sum _{d\mid n}J_{k}(d)=n^{k}.}







J

k


(
n
)
=

∑

δ
∣
n


μ

(


n
δ


)


δ

k


=

n

k



∑

δ
∣
n





μ
(
δ
)


δ

k




.


{\displaystyle J_{k}(n)=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)\delta ^{k}=n^{k}\sum _{\delta \mid n}{\frac {\mu (\delta )}{\delta ^{k}}}.}

Möbius inversion





∑

δ
∣
n



δ

s



J

r


(
δ
)

J

s



(


n
δ


)

=

J

r
+
s


(
n
)


{\displaystyle \sum _{\delta \mid n}\delta ^{s}J_{r}(\delta )J_{s}\left({\frac {n}{\delta }}\right)=J_{r+s}(n)}







∑

δ
∣
n


φ
(
δ
)
d

(


n
δ


)

=
σ
(
n
)
.


{\displaystyle \sum _{\delta \mid n}\varphi (\delta )d\left({\frac {n}{\delta }}\right)=\sigma (n).}







∑

δ
∣
n



|

μ
(
δ
)

|

=

2

ω
(
n
)


.


{\displaystyle \sum _{\delta \mid n}|\mu (\delta )|=2^{\omega (n)}.}







|

μ
(
n
)

|

=

∑

δ
∣
n


μ

(


n
δ


)


2

ω
(
δ
)


.


{\displaystyle |\mu (n)|=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)2^{\omega (\delta )}.}

Möbius inversion





∑

δ
∣
n



2

ω
(
δ
)


=
d
(

n

2


)
.


{\displaystyle \sum _{\delta \mid n}2^{\omega (\delta )}=d(n^{2}).}







2

ω
(
n
)


=

∑

δ
∣
n


μ

(


n
δ


)

d
(

δ

2


)
.


{\displaystyle 2^{\omega (n)}=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)d(\delta ^{2}).}

Möbius inversion





∑

δ
∣
n


d
(

δ

2


)
=

d

2


(
n
)
.


{\displaystyle \sum _{\delta \mid n}d(\delta ^{2})=d^{2}(n).}






d
(

n

2


)
=

∑

δ
∣
n


μ

(


n
δ


)


d

2


(
δ
)
.


{\displaystyle d(n^{2})=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)d^{2}(\delta ).}

Möbius inversion





∑

δ
∣
n


d

(


n
δ


)


2

ω
(
δ
)


=

d

2


(
n
)
.


{\displaystyle \sum _{\delta \mid n}d\left({\frac {n}{\delta }}\right)2^{\omega (\delta )}=d^{2}(n).}







∑

δ
∣
n


λ
(
δ
)
=


{




1

if

n

is a square






0

if

n

is not square.









{\displaystyle \sum _{\delta \mid n}\lambda (\delta )={\begin{cases}&1{\text{ if }}n{\text{ is a square }}\\&0{\text{ if }}n{\text{ is not square.}}\end{cases}}}

where λ is the Liouville function.





∑

δ
∣
n


Λ
(
δ
)
=
log
⁡
n
.


{\displaystyle \sum _{\delta \mid n}\Lambda (\delta )=\log n.}






Λ
(
n
)
=

∑

δ
∣
n


μ

(


n
δ


)

log
⁡
(
δ
)
.


{\displaystyle \Lambda (n)=\sum _{\delta \mid n}\mu \left({\frac {n}{\delta }}\right)\log(\delta ).}

Möbius inversion




= Sums of squares

=
For all



k
≥
4
,




r

k


(
n
)
>
0.


{\displaystyle k\geq 4,\;\;\;r_{k}(n)>0.}

(Lagrange's four-square theorem).





r

2


(
n
)
=
4

∑

d
∣
n



(



−
4

d


)

,


{\displaystyle r_{2}(n)=4\sum _{d\mid n}\left({\frac {-4}{d}}\right),}


where the Kronecker symbol has the values





(



−
4

n


)

=


{



+
1



if

n
≡
1


(
mod

4
)





−
1



if

n
≡
3


(
mod

4
)








0



if

n

is even

.








{\displaystyle \left({\frac {-4}{n}}\right)={\begin{cases}+1&{\text{if }}n\equiv 1{\pmod {4}}\\-1&{\text{if }}n\equiv 3{\pmod {4}}\\\;\;\;0&{\text{if }}n{\text{ is even}}.\\\end{cases}}}


There is a formula for r3 in the section on class numbers below.





r

4


(
n
)
=
8

∑




4

∤

d


d
∣
n





d
=
8
(
2
+
(
−
1

)

n


)

∑




2

∤

d


d
∣
n





d
=


{



8
σ
(
n
)



if

n

is odd





24
σ

(


n

2

ν




)




if

n

is even







,


{\displaystyle r_{4}(n)=8\sum _{\stackrel {d\mid n}{4\,\nmid \,d}}d=8(2+(-1)^{n})\sum _{\stackrel {d\mid n}{2\,\nmid \,d}}d={\begin{cases}8\sigma (n)&{\text{if }}n{\text{ is odd }}\\24\sigma \left({\frac {n}{2^{\nu }}}\right)&{\text{if }}n{\text{ is even }}\end{cases}},}


where ν = ν2(n).





r

6


(
n
)
=
16

∑

d
∣
n


χ

(


n
d


)


d

2


−
4

∑

d
∣
n


χ
(
d
)

d

2


,


{\displaystyle r_{6}(n)=16\sum _{d\mid n}\chi \left({\frac {n}{d}}\right)d^{2}-4\sum _{d\mid n}\chi (d)d^{2},}


where



χ
(
n
)
=

(



−
4

n


)

.


{\displaystyle \chi (n)=\left({\frac {-4}{n}}\right).}


Define the function σk*(n) as





σ

k


∗


(
n
)
=
(
−
1

)

n



∑

d
∣
n


(
−
1

)

d



d

k


=


{




∑

d
∣
n



d

k


=

σ

k


(
n
)



if

n

is odd






∑




2

∣

d


d
∣
n






d

k


−

∑




2

∤

d


d
∣
n






d

k





if

n

is even

.








{\displaystyle \sigma _{k}^{*}(n)=(-1)^{n}\sum _{d\mid n}(-1)^{d}d^{k}={\begin{cases}\sum _{d\mid n}d^{k}=\sigma _{k}(n)&{\text{if }}n{\text{ is odd }}\\\sum _{\stackrel {d\mid n}{2\,\mid \,d}}d^{k}-\sum _{\stackrel {d\mid n}{2\,\nmid \,d}}d^{k}&{\text{if }}n{\text{ is even}}.\end{cases}}}


That is, if n is odd, σk*(n) is the sum of the kth powers of the divisors of n, that is, σ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.





r

8


(
n
)
=
16

σ

3


∗


(
n
)
.


{\displaystyle r_{8}(n)=16\sigma _{3}^{*}(n).}


Adopt the convention that Ramanujan's τ(x) = 0 if x is not an integer.





r

24


(
n
)
=


16
691



σ

11


∗


(
n
)
+


128
691



{

(
−
1

)

n
−
1


259
τ
(
n
)
−
512
τ

(


n
2


)


}



{\displaystyle r_{24}(n)={\frac {16}{691}}\sigma _{11}^{*}(n)+{\frac {128}{691}}\left\{(-1)^{n-1}259\tau (n)-512\tau \left({\frac {n}{2}}\right)\right\}}






= 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:





(


∑

n
=
0


∞



a

n



x

n



)


(


∑

n
=
0


∞



b

n



x

n



)

=

∑

i
=
0


∞



∑

j
=
0


∞



a

i



b

j



x

i
+
j


=

∑

n
=
0


∞



(


∑

i
=
0


n



a

i



b

n
−
i



)


x

n


=

∑

n
=
0


∞



c

n



x

n


.


{\displaystyle \left(\sum _{n=0}^{\infty }a_{n}x^{n}\right)\left(\sum _{n=0}^{\infty }b_{n}x^{n}\right)=\sum _{i=0}^{\infty }\sum _{j=0}^{\infty }a_{i}b_{j}x^{i+j}=\sum _{n=0}^{\infty }\left(\sum _{i=0}^{n}a_{i}b_{n-i}\right)x^{n}=\sum _{n=0}^{\infty }c_{n}x^{n}.}


The sequence




c

n


=

∑

i
=
0


n



a

i



b

n
−
i




{\displaystyle c_{n}=\sum _{i=0}^{n}a_{i}b_{n-i}}

is called the convolution or the Cauchy product of the sequences an and bn.
These formulas may be proved analytically (see Eisenstein series) or by elementary methods.





σ

3


(
n
)
=


1
5



{

6
n

σ

1


(
n
)
−

σ

1


(
n
)
+
12

∑

0
<
k
<
n



σ

1


(
k
)

σ

1


(
n
−
k
)

}

.


{\displaystyle \sigma _{3}(n)={\frac {1}{5}}\left\{6n\sigma _{1}(n)-\sigma _{1}(n)+12\sum _{0






σ

5


(
n
)
=


1
21



{

10
(
3
n
−
1
)

σ

3


(
n
)
+

σ

1


(
n
)
+
240

∑

0
<
k
<
n



σ

1


(
k
)

σ

3


(
n
−
k
)

}

.


{\displaystyle \sigma _{5}(n)={\frac {1}{21}}\left\{10(3n-1)\sigma _{3}(n)+\sigma _{1}(n)+240\sum _{0










σ

7


(
n
)



=


1
20



{

21
(
2
n
−
1
)

σ

5


(
n
)
−

σ

1


(
n
)
+
504

∑

0
<
k
<
n



σ

1


(
k
)

σ

5


(
n
−
k
)

}







=

σ

3


(
n
)
+
120

∑

0
<
k
<
n



σ

3


(
k
)

σ

3


(
n
−
k
)
.






{\displaystyle {\begin{aligned}\sigma _{7}(n)&={\frac {1}{20}}\left\{21(2n-1)\sigma _{5}(n)-\sigma _{1}(n)+504\sum _{0










σ

9


(
n
)



=


1
11



{

10
(
3
n
−
2
)

σ

7


(
n
)
+

σ

1


(
n
)
+
480

∑

0
<
k
<
n



σ

1


(
k
)

σ

7


(
n
−
k
)

}







=


1
11



{

21

σ

5


(
n
)
−
10

σ

3


(
n
)
+
5040

∑

0
<
k
<
n



σ

3


(
k
)

σ

5


(
n
−
k
)

}

.






{\displaystyle {\begin{aligned}\sigma _{9}(n)&={\frac {1}{11}}\left\{10(3n-2)\sigma _{7}(n)+\sigma _{1}(n)+480\sum _{0





τ
(
n
)
=


65
756



σ

11


(
n
)
+


691
756



σ

5


(
n
)
−


691
3



∑

0
<
k
<
n



σ

5


(
k
)

σ

5


(
n
−
k
)
,


{\displaystyle \tau (n)={\frac {65}{756}}\sigma _{11}(n)+{\frac {691}{756}}\sigma _{5}(n)-{\frac {691}{3}}\sum _{0
where τ(n) is Ramanujan's function.
Since σk(n) (for natural number k) and τ(n) are integers, the above formulas can be used to prove congruences for the functions. See Ramanujan tau function for some examples.
Extend the domain of the partition function by setting p(0) = 1.




p
(
n
)
=


1
n



∑

1
≤
k
≤
n


σ
(
k
)
p
(
n
−
k
)
.


{\displaystyle p(n)={\frac {1}{n}}\sum _{1\leq k\leq n}\sigma (k)p(n-k).}

This recurrence can be used to compute p(n).




= Class number related

=
Peter Gustav Lejeune Dirichlet discovered formulas that relate the class number h of quadratic number fields to the Jacobi symbol.
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:





(


a
2


)

=


{






0



if

a

is even





(
−
1

)




a

2


−
1

8






if

a

is odd.









{\displaystyle \left({\frac {a}{2}}\right)={\begin{cases}\;\;\,0&{\text{ if }}a{\text{ is even}}\\(-1)^{\frac {a^{2}-1}{8}}&{\text{ if }}a{\text{ is odd. }}\end{cases}}}


Then if D < −4 is a fundamental discriminant








h
(
D
)



=


1
D



∑

r
=
1



|

D

|



r

(


D
r


)







=


1

2
−

(



D
2



)





∑

r
=
1



|

D

|


/

2



(


D
r


)

.






{\displaystyle {\begin{aligned}h(D)&={\frac {1}{D}}\sum _{r=1}^{|D|}r\left({\frac {D}{r}}\right)\\&={\frac {1}{2-\left({\tfrac {D}{2}}\right)}}\sum _{r=1}^{|D|/2}\left({\frac {D}{r}}\right).\end{aligned}}}


There is also a formula relating r3 and h. Again, let D be a fundamental discriminant, D < −4. Then





r

3


(

|

D

|

)
=
12

(

1
−

(


D
2


)


)

h
(
D
)
.


{\displaystyle r_{3}(|D|)=12\left(1-\left({\frac {D}{2}}\right)\right)h(D).}





= Prime-count related

=
Let




H

n


=
1
+


1
2


+


1
3


+
⋯
+


1
n




{\displaystyle H_{n}=1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}}

be the nth harmonic number. Then




σ
(
n
)
≤

H

n


+

e


H

n




log
⁡

H

n




{\displaystyle \sigma (n)\leq H_{n}+e^{H_{n}}\log H_{n}}

is true for every natural number n if and only if the Riemann hypothesis is true.
The Riemann hypothesis is also equivalent to the statement that, for all n > 5040,




σ
(
n
)
<

e

γ


n
log
⁡
log
⁡
n


{\displaystyle \sigma (n)
(where γ is the Euler–Mascheroni constant). This is Robin's theorem.





∑

p



ν

p


(
n
)
=
Ω
(
n
)
.


{\displaystyle \sum _{p}\nu _{p}(n)=\Omega (n).}





ψ
(
x
)
=

∑

n
≤
x


Λ
(
n
)
.


{\displaystyle \psi (x)=\sum _{n\leq x}\Lambda (n).}






Π
(
x
)
=

∑

n
≤
x





Λ
(
n
)


log
⁡
n



.


{\displaystyle \Pi (x)=\sum _{n\leq x}{\frac {\Lambda (n)}{\log n}}.}







e

θ
(
x
)


=

∏

p
≤
x


p
.


{\displaystyle e^{\theta (x)}=\prod _{p\leq x}p.}







e

ψ
(
x
)


=
lcm
⁡
[
1
,
2
,
…
,
⌊
x
⌋
]
.


{\displaystyle e^{\psi (x)}=\operatorname {lcm} [1,2,\dots ,\lfloor x\rfloor ].}






= Menon's identity

=
In 1965 P Kesava Menon proved





∑




gcd
(
k
,
n
)
=
1


1
≤
k
≤
n





gcd
(
k
−
1
,
n
)
=
φ
(
n
)
d
(
n
)
.


{\displaystyle \sum _{\stackrel {1\leq k\leq n}{\gcd(k,n)=1}}\gcd(k-1,n)=\varphi (n)d(n).}


This has been generalized by a number of mathematicians. For example,

B. Sury




∑




gcd
(

k

1


,
n
)
=
1


1
≤

k

1


,

k

2


,
…
,

k

s


≤
n





gcd
(

k

1


−
1
,

k

2


,
…
,

k

s


,
n
)
=
φ
(
n
)

σ

s
−
1


(
n
)
.


{\displaystyle \sum _{\stackrel {1\leq k_{1},k_{2},\dots ,k_{s}\leq n}{\gcd(k_{1},n)=1}}\gcd(k_{1}-1,k_{2},\dots ,k_{s},n)=\varphi (n)\sigma _{s-1}(n).}


N. Rao




∑




gcd
(

k

1


,

k

2


,
…
,

k

s


,
n
)
=
1


1
≤

k

1


,

k

2


,
…
,

k

s


≤
n





gcd
(

k

1


−

a

1


,

k

2


−

a

2


,
…
,

k

s


−

a

s


,
n

)

s


=

J

s


(
n
)
d
(
n
)
,


{\displaystyle \sum _{\stackrel {1\leq k_{1},k_{2},\dots ,k_{s}\leq n}{\gcd(k_{1},k_{2},\dots ,k_{s},n)=1}}\gcd(k_{1}-a_{1},k_{2}-a_{2},\dots ,k_{s}-a_{s},n)^{s}=J_{s}(n)d(n),}

where a1, a2, ..., as are integers, gcd(a1, a2, ..., as, n) = 1.
László Fejes Tóth




∑




gcd
(
k
,
m
)
=
1


1
≤
k
≤
m





gcd
(

k

2


−
1
,

m

1


)
gcd
(

k

2


−
1
,

m

2


)
=
φ
(
n
)

∑





d

2


∣

m

2





d

1


∣

m

1







φ
(
gcd
(

d

1


,

d

2


)
)

2

ω
(
lcm
⁡
(

d

1


,

d

2


)
)


,


{\displaystyle \sum _{\stackrel {1\leq k\leq m}{\gcd(k,m)=1}}\gcd(k^{2}-1,m_{1})\gcd(k^{2}-1,m_{2})=\varphi (n)\sum _{\stackrel {d_{1}\mid m_{1}}{d_{2}\mid m_{2}}}\varphi (\gcd(d_{1},d_{2}))2^{\omega (\operatorname {lcm} (d_{1},d_{2}))},}

where m1 and m2 are odd, m = lcm(m1, m2).
In fact, if f is any arithmetical function





∑




gcd
(
k
,
n
)
=
1


1
≤
k
≤
n





f
(
gcd
(
k
−
1
,
n
)
)
=
φ
(
n
)

∑

d
∣
n





(
μ
∗
f
)
(
d
)


φ
(
d
)



,


{\displaystyle \sum _{\stackrel {1\leq k\leq n}{\gcd(k,n)=1}}f(\gcd(k-1,n))=\varphi (n)\sum _{d\mid n}{\frac {(\mu *f)(d)}{\varphi (d)}},}


where



∗


{\displaystyle *}

stands for Dirichlet convolution.




= Miscellaneous

=
Let m and n be distinct, odd, and positive. Then the Jacobi symbol satisfies the law of quadratic reciprocity:





(


m
n


)


(


n
m


)

=
(
−
1

)

(
m
−
1
)
(
n
−
1
)

/

4


.


{\displaystyle \left({\frac {m}{n}}\right)\left({\frac {n}{m}}\right)=(-1)^{(m-1)(n-1)/4}.}


Let D(n) be the arithmetic derivative. Then the logarithmic derivative






D
(
n
)

n


=

∑




p

prime



p
∣
n









v

p


(
n
)

p


.


{\displaystyle {\frac {D(n)}{n}}=\sum _{\stackrel {p\mid n}{p{\text{ prime}}}}{\frac {v_{p}(n)}{p}}.}

See Arithmetic derivative for details.
Let λ(n) be Liouville's function. Then





|

λ
(
n
)

|

μ
(
n
)
=
λ
(
n
)

|

μ
(
n
)

|

=
μ
(
n
)
,


{\displaystyle |\lambda (n)|\mu (n)=\lambda (n)|\mu (n)|=\mu (n),}

and




λ
(
n
)
μ
(
n
)
=

|

μ
(
n
)

|

=

μ

2


(
n
)
.


{\displaystyle \lambda (n)\mu (n)=|\mu (n)|=\mu ^{2}(n).}


Let λ(n) be Carmichael's function. Then




λ
(
n
)
∣
ϕ
(
n
)
.


{\displaystyle \lambda (n)\mid \phi (n).}

Further,




λ
(
n
)
=
ϕ
(
n
)

if and only if

n
=


{



1
,
2
,
4
;




3
,
5
,
7
,
9
,
11
,
…

(that is,


p

k



, where

p

is an odd prime)

;




6
,
10
,
14
,
18
,
…

(that is,

2

p

k



, where

p

is an odd prime)

.








{\displaystyle \lambda (n)=\phi (n){\text{ if and only if }}n={\begin{cases}1,2,4;\\3,5,7,9,11,\ldots {\text{ (that is, }}p^{k}{\text{, where }}p{\text{ is an odd prime)}};\\6,10,14,18,\ldots {\text{ (that is, }}2p^{k}{\text{, where }}p{\text{ is an odd prime)}}.\end{cases}}}


See Multiplicative group of integers modulo n and Primitive root modulo n.






2

ω
(
n
)


≤
d
(
n
)
≤

2

Ω
(
n
)


.


{\displaystyle 2^{\omega (n)}\leq d(n)\leq 2^{\Omega (n)}.}








6

π

2




<



ϕ
(
n
)
σ
(
n
)


n

2




<
1.


{\displaystyle {\frac {6}{\pi ^{2}}}<{\frac {\phi (n)\sigma (n)}{n^{2}}}<1.}











c

q


(
n
)



=



μ

(


q

gcd
(
q
,
n
)



)



ϕ

(


q

gcd
(
q
,
n
)



)




ϕ
(
q
)






=

∑

δ
∣
gcd
(
q
,
n
)


μ

(


q
δ


)

δ
.






{\displaystyle {\begin{aligned}c_{q}(n)&={\frac {\mu \left({\frac {q}{\gcd(q,n)}}\right)}{\phi \left({\frac {q}{\gcd(q,n)}}\right)}}\phi (q)\\&=\sum _{\delta \mid \gcd(q,n)}\mu \left({\frac {q}{\delta }}\right)\delta .\end{aligned}}}

Note that



ϕ
(
q
)
=

∑

δ
∣
q


μ

(


q
δ


)

δ
.


{\displaystyle \phi (q)=\sum _{\delta \mid q}\mu \left({\frac {q}{\delta }}\right)\delta .}







c

q


(
1
)
=
μ
(
q
)
.


{\displaystyle c_{q}(1)=\mu (q).}






c

q


(
q
)
=
ϕ
(
q
)
.


{\displaystyle c_{q}(q)=\phi (q).}






∑

δ
∣
n



d

3


(
δ
)
=


(


∑

δ
∣
n


d
(
δ
)

)


2


.


{\displaystyle \sum _{\delta \mid n}d^{3}(\delta )=\left(\sum _{\delta \mid n}d(\delta )\right)^{2}.}

Compare this with 13 + 23 + 33 + ... + n3 = (1 + 2 + 3 + ... + n)2




d
(
u
v
)
=

∑

δ
∣
gcd
(
u
,
v
)


μ
(
δ
)
d

(


u
δ


)

d

(


v
δ


)

.


{\displaystyle d(uv)=\sum _{\delta \mid \gcd(u,v)}\mu (\delta )d\left({\frac {u}{\delta }}\right)d\left({\frac {v}{\delta }}\right).}







σ

k


(
u
)

σ

k


(
v
)
=

∑

δ
∣
gcd
(
u
,
v
)



δ

k



σ

k



(



u
v


δ

2




)

.


{\displaystyle \sigma _{k}(u)\sigma _{k}(v)=\sum _{\delta \mid \gcd(u,v)}\delta ^{k}\sigma _{k}\left({\frac {uv}{\delta ^{2}}}\right).}






τ
(
u
)
τ
(
v
)
=

∑

δ
∣
gcd
(
u
,
v
)



δ

11


τ

(



u
v


δ

2




)

,


{\displaystyle \tau (u)\tau (v)=\sum _{\delta \mid \gcd(u,v)}\delta ^{11}\tau \left({\frac {uv}{\delta ^{2}}}\right),}

where τ(n) is Ramanujan's function.




First 100 values of some arithmetic functions






Notes






References


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
Bateman, Paul T.; Diamond, Harold G. (2004), Analytic number theory, an introduction, World Scientific, ISBN 978-981-238-938-1
Cohen, Henri (1993), A Course in Computational Algebraic Number Theory, Berlin: Springer, ISBN 3-540-55640-0
Edwards, Harold (1977). Fermat's Last Theorem. New York: Springer. ISBN 0-387-90230-9.
Hardy, G. H. (1999), Ramanujan: Twelve Lectures on Subjects Suggested by his Life and work, Providence RI: AMS / Chelsea, hdl:10115/1436, ISBN 978-0-8218-2023-0
Hardy, G. H.; Wright, E. M. (1979) [1938]. An Introduction to the Theory of Numbers (5th ed.). Oxford: Clarendon Press. ISBN 0-19-853171-0. MR 0568909. Zbl 0423.10001.
Jameson, G. J. O. (2003), The Prime Number Theorem, Cambridge University Press, ISBN 0-521-89110-8
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
Elliott Mendelson (1987), Introduction to Mathematical Logic, CRC Press, ISBN 0-412-80830-7
Nagell, Trygve (1964), Introduction to number theory (2nd Edition), Chelsea, ISBN 978-0-8218-2833-5
Niven, Ivan M.; Zuckerman, Herbert S. (1972), An introduction to the theory of numbers (3rd Edition), John Wiley & Sons, ISBN 0-471-64154-5
Pettofrezzo, Anthony J.; Byrkit, Donald R. (1970), Elements of Number Theory, Englewood Cliffs: Prentice Hall, LCCN 77-81766
Ramanujan, Srinivasa (2000), Collected Papers, Providence RI: AMS / Chelsea, ISBN 978-0-8218-2076-6
Williams, Kenneth S. (2011), Number theory in the spirit of Liouville, London Mathematical Society Student Texts, vol. 76, Cambridge: Cambridge University Press, ISBN 978-0-521-17562-3, Zbl 1227.11002




Further reading


Schwarz, Wolfgang; Spilker, Jürgen (1994), Arithmetical Functions. An introduction to elementary and analytic properties of arithmetic functions and to some of their almost-periodic properties, London Mathematical Society Lecture Note Series, vol. 184, Cambridge University Press, ISBN 0-521-42725-8, Zbl 0807.11001




External links


"Arithmetic function", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
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
Dineva, Rosica, The Euler Totient, the Möbius, and the Divisor Functions Archived 2021-01-16 at the Wayback Machine
László Tóth, Menon's Identity and arithmetical sums representing functions of several variables

Kata Kunci Pencarian:

• Pertumbuhan eksponensial
• Bilangan prima
• Algoritma
• Hipotesis Riemann
• 1 (angka)
• 0 (angka)
• Pecahan berlanjut
• Kurva eliptik
• Geometri aritmetika
• Daftar algoritme
• Arithmetic function
• Arithmetic derivative
• Möbius function
• Elementary function arithmetic
• Completely multiplicative function
• Sigma function
• Arithmetic zeta function
• Multiplicative function
• Additive function
• Tau function