Lec14: Multiplicative Arithmetic Functions I

04 Apr 2023, MATH4024-Number Theory, Lecturer: Prof A. Munagi

1 Introduction
We begin with the essential definitions.
Definition 1.1. An arithmetic function is a function that is defined for all positive
integers.
An arithmetic function f is called multiplicative if f (mn) = f (m)f (n), whenever
(m, n) = 1.
An arithmetic function f is called completely multiplicative if f (mn) = f (m)f (n)
for all m, n ∈ Z+ .
Examples. f (n) = n2 is completely multiplicative and hence multiplicative.
The function f (n) = n + 1 is not multiplicative.
Other multiplicative functions include f (n) = 1 ∀ n and f (n) = n.
The Euler phi function φ is multiplicative but not completely multiplicative (proved
later). For example,
φ(4)φ(5) = 2 · 4 = 8 = φ(20). But φ(4)φ(6) = 2 · 2 = 4 6= φ(24) = 8.

Exercise 1. Which of the following arithmetic functions f is completely multiplicative?

√
(a) f (n) = n/2 (b) f (n) = log n (c) f (n) = nn (d) f (n) = n! (e) f (n) = n

A multiplicative function has the property that its value at an integer n is the
product of its values at each of the prime powers in the prime-power factorization of n.
Thus to find a formula for f (n) it suffices to find a formula for f (pai i ), where
n = pa11 · · · pakk , so that f (n) = f (pa11 ) · · · f (pakk ).

Exercise 2. Prove that f is multiplicative if and only if f (pa11 · · · pakk ) = f (pa11 ) · · · f (pakk ),
for all distinct primes pi and integers ai > 0.
[Hint: use induction on k.]

1
Prof A. Munagi Lec14: Arithmetic Functions I MATH4024-Number Theory

1.1 The Euler Phi Function

Theorem 1.2. If p is prime, then
φ(pa ) = pa − pa−1 ∀ a ∈ Z+ .
Proof. The positive integers less that pa that are not relatively prime to pa are those
integers not exceeding pa that are divisible by p, that is all integers kp, where 1 ≤ k ≤
pa−1 . Since there are precisely pa−1 such integers, there are pa − pa−1 integers less than
pa that are relatively prime to pa . Hence the result.
Theorem 1.3. The Euler phi function φ is multiplicative, that is, if m, n ∈ Z+ with
(m, n) = 1, then
φ(mn) = φ(m)φ(n).
Proof. (Details postponed. Enrichment work: try to find a proof of your own).

Theorem 1.4. Let the prime-power factorization of n be n = pa11 pa22 · · · pakk . Then
φ(n) = pa11 −1 pa22 −1 · · · pkak −1 (p1 − 1)(p2 − 1) · · · (pk − 1) (1)
or
k   Y 
Y 1 1
φ(n) = n 1− =n 1− . (2)
i=1
pi p
p|n

Proof. Because φ is multiplicative, Exerc. 2 implies that

φ(n) = φ(pa11 pa22 · · · pakk ) = φ(pa11 )φ(pa22 ) · · · φ(pakk ).
Hence by Theorem 1.2 we get
φ(n) = (pa11 − p1a1 −1 )(pa22 − pa22 −1 ) · · · (pakk − pakk −1 )
= pa11 −1 p2a2 −1 · · · pkak −1 (p1 − 1)(p2 − 1) · · · (pk − 1)
= ... ... ... ... ... ... .

Examples.
φ(400) = φ(24 · 52 ) = 23 · 51 · 1 · 4 = 160.
φ(140) = φ(22 · 5 · 7) = 21 · 50 · 70 · 1 · 4 · 6 = 48.

Exercise 3. Find the Euler phi function of (a) 720 (b) 2 · 3 · 5 · 7 · 11 · 13 (a) 20!.

Exercise 4. Prove: if n > 2, then φ(n) is an even number.

Exercise 5. Find all positive integers n such that (a) φ(n) = 3, and (b) φ(n) = 4.