Elementary number theory and its applications, Chapter 7,

Multiplicative Functions

Contents
1

The Euler Phi-Function

1) a), e) and i) is completely multiplicative.

2) the value of the Euler phi-function is as follow:
n
100
256
1001
2 3 5 7 11 13
10!
20!

p1 1 p2 2 . . . ps s
22 52
28
11 13 7
2 3 5 7 11 13
27 33 52 7
217 37 54 72 11 13 17 19

(n)
2 5 (2 1) (5 1) = 40
2 7 (2 1) = 128
10 12 8 = 960
1 2 4 6 10 12 = 32720
26 32 2 5 4 7 6 = 138240
216 36 2 53 4 7 6 10 12 16 18

3)
(5186) = (2 2593) = 2592
(5187) = (3 7 13 19) = 2 6 12 18 = 2592
(5188) = (22 1297) = 2 1 1296 = 2592
4) (a) (2) = (1) = 1
(b) (4) = (6) = (3) = 2
(c) NULL
(d) (10) = (5) = (8) = (12) = 4
5) (9) = (7) = (18) = (14) = 6
6) if (n) = 12, then the prime divisor of n must be not bigger than 13, and the prime divisor of power bigger
than 1 can only be 2 or 3. Consider the cases as follow:
(a) 13|n, then n = 13n1 , 13 - n1 , 12 = (n) = 12(n1 ), (n1 ) = 1. Hence, by the 4th exerciese,
n1 = 1orn1 = 2. Hence n = 13 orn = 26.
(b) 7|n, then n = 7n1 , 7 - n1 , 12 = (n) = 6(n1 ), (n1 ) = 2. Hence, by the 4th exerciese, n =
28, 42, 21
(c) 5|n, then n = 5n1 , 5 - n1 , 12 = (n) = 4(n1 ), (n1 ) = 3. Hence, by the 4th exerciese, no n in this
case.
(d) n = 21 32 , 1 > 0, 2 > 0, then 21 32 1 = 12, 1 = 2 = 2, n = 36
(e) n = 32 or n = 21 , no n in this case.
Hence, 13, 26, 28, 42, 21, 36 are all positive integers n such that (n) = 12.
1

7) if (n) = 24, then the prime divisor of n must be not bigger than 13, and the prime divisor of power bigger
than 1 can only be 2 or 3. Consider the cases as follow:
(a) n = 13n1 , (n1 ) = 2, n1 = 4, 6, 3, n = 52, 78, 39
(b) n = 7n1 ,(n1 ) = 4, n1 = 10, 5, 8, 12,n = 70, 35, 56, 84
(c) n = 5n1 ,(n1 ) = 6,n1 = 9, 7, 18, 14,n = 45, 35, 90, 70
(d) n = 21 32 ,21 32 1 = 23 3,n = 72
Hence, 52, 78, 39, 70, 35, 56, 84, 45, 90, 72 are all positive integers n such that (n) = 12.
8) if (n) = 14, then the prime divisor of n must be not bigger than 3, so 7 - (n).
9) (2n).
10) the number of k such that (k) = n.
11) if (3, n) = 1, then (3n) = 2(n), contradicted. if n = 3 n1 , n - n1 , then (3n) = 3 2 (n1 ) = 3(n).
Hence, (3n) = 3(n) 3|n.
12) if n divided by 23 , then of course 4|(n). if n = 4n1 , n1 odd, then must be an odd prime p, p|n. otherwise,
there must be two different odd prime number p1 , p2 such that p1 , p2 divide n.
13) n even. if n = 2s , n/2 = (n). if n = 2s pa11 pa22 . . . pas s , n/2 = (n) means that p1 p2 . . . ps = (p1
1)(p2 1) . . . (ps 1) , which is impossible. Hence, n/2 = (n) n = 2s
14) n = pa11 pa22 . . . pas s . (n)|n means that (p1 1)(p2 1) . . . (ps 1)|p1 p2 . . . ps . if s = 1, then (p1 1)|p1 ,
p1 = 2, n = 2s . if s > 2, then 4|p1 p2 . . . ps , contradicted. if s = 2, then (p2 1)|2p2 , (p2 1)|2, p2 = 3.
Hence, (n)|n n = 2s 3t .
15) if n odd, then (2, n) = 1. Hence, (2n) = (2)(n) = (n). if n even, n = 2s n1 , then (2n) =
2s (n1 ) = 2 2s1 (n1 ) = 2(n).
Remark. if n is a positive integer, p is prime, then
{
(p 1)(n) p - n
(pn) =
p(n)
p|n
proof: if p - n, then (p, n) = 1, (pn) = (p)(n) = (p 1)(n). if p|n, n = ps n1 , p - n1 . (pn) =
(ps+1 n1 ) = (ps+1 )(n1 ) = ps (p 1)(n1 ) = p(ps )(n1 ) = p(n).
16) because (p1 1)(p2 1) . . . (ps 1) is divisible by 2k .
17) n = 2k p1 p2 . . . ps , pi distinct and pi 1is power of 2.
18) (4n) = 2(2n) = 2(n).
19) the same with the 13th exerciese.
20) for the remark of 15th.
21) Let m = m1 p, n = n1 p, (m1 , n1 ) = 1.
(mn) = (m1 n1 p2 )
= p(m1 n1 p)
if p|m1 , p - n1 , then
(mn) = p(m1 n1 p)
= p2 (m1 )(n1 )
= p (p(m1 )) ((p 1)(n1 ))/(p 1)
= p(m)(n)/(p 1)
2

if p - m1 , p - n1 , then
(mn) = p(m1 n1 p)
= p(p 1)(m1 )(n1 )
= p(m)(n)/(p 1)
22) Let m = pa11 pa22 . . . pas s .
(mk ) = pa11 k1 pa22 k1 . . . pas s k1 (p1 1)(p2 1) . . . (ps 1)
a (k1) a2 (k1)
p2
. . . pas s (k1) pa11 1 pa22 1 . . . pas s 1 (p1
k1

= p1 1
=m

1)(p2 1) . . . (ps 1)

(m)

23) Show that if a and b are positive integers, then

(ab) = (a, b)(a)(b)/((a, b)).
Conclude that (ab) > (a)(b) when (a, b) > 1.
Proof (induction) Let (a, b) = c = ps11 ps22 . . . pst t . a = a1 c, b = b1 c, (a1 , b1 ) = 1
when t = 1, (ab) = (a1 b1 p12s1 ). Suppose p1 - b1 .
(ab) = (a1 p12s1 )(b1 )
= ps11 (a1 ps11 )(b1 )
= ps11 ps11 1 (p1 1)(b1 )(a)/(ps11 1 (p1 1))
= c(a)(b)/(c)
so it is true for t = 1.
when it is true for t = k, now t = k + 1.
sk+1
sk+1
let a
= a/pk+1
, b = b/pk+1
, then
(
ab) = (
a, b)(
a)(b)/((
a, b))
if pk+1 |
a, pk+1 - b, then
2sk+1
(ab) = pk+1
(
ab)
2sk+1
= pk+1
)(
a, b)(
a)(b)/((
a, b))
s
= (a, b)p k+1 (
a)(b)/((
a, b))
k+1

= (a, b)(a)(b)/((
a, b))
s

k+1
= (a, b)(a)pk+1

sk+1 1
(pk+1 1)(b)/(pk+1
(pk+1 1)((
a, b)))

= (a, b)(a)(b)/((a, b))

if pk+1 - a
, pk+1 - b, then
2s

(pk+1 1)(
ab)

2s

(pk+1 1)(
a, b)(
a)(b)/((
a, b))

k+1
(ab) = pk+1
k+1
= pk+1

(pk+1 1)(
a)(b)/((
a, b))
= (a, b)(a)(b)/((
a, b))

k+1
= (a, b)pk+1

k+1
= (a, b)(a)pk+1

sk+1 1
(pk+1 1)(b)/(pk+1
(pk+1 1)((
a, b)))

= (a, b)(a)(b)/((a, b))

24) (a) 101, prime

3

(b) 1009, prime

(c) 10007,prime
(d) 100003
25) if there are only a finite number of primes p1 , p2 , . . . , pk . (p1 p2 . . . pn ) = (p1 1)(p2 1) . . . (pk 1) > 1.
However, every number bigger than 1 is product of these primes so that only 1 is relatively prime with
p1 p2 . . . pn .
26) Let n be the only positive integer such that (n) = k. if n odd, then (2n) = (n) = k. Hence n is even. if
4 - n, (n) = (n/22) = (n/2) = k. hence 4|n. if 3 - n, (3n/2) = (3)(n/2) = 2(n/2) = (n).
if 3|n, 9 - n, (n) = (n/3)(3) = (n/3) 2 = (2n/3).
27) Let n = pa11 pa22 . . . pas s , (n) = k. Hence pa11 1 pa22 1 . . . pas s 1 (p1 1)(p2 1) . . . (ps 1) = k. Hence
(pi 1)|k for i = 1, 2, . . . , n. Since there are only finite divisors of k, there are only finite primes pi such
that pi |n. And ai cannot be too large. So the number of solutions if finite.
28) Let n be a positive integer such that (n) = 2r p and n = pa11 pa22 . . . pas s , then (pi 1)|2r p, i = 1, 2, . . . s.
since p + 1, 2a + 1 for a = 1, 2, . . . , r is composite, pi = 2 or pi = 2t + 1 for some t r, which means
that pi is a Fermat prime. if for some i, ai 2. Then pi |2r p. Because p is not a Fermat prime, pi = 2. Let
n = 2s p1 p2 . . . pt , then (n) = 2s1 (p1 1) . . . (pt 1) = 2l = 2r p.
something about Fermat primes
if 2n + 1 is prime, n = 2m . it is because if n = ab, a, b > 1 and b is odd, then 2n + 1 (2a )b + 1
(1)b + 1 0( mod 2a + 1). Hence, all primes of 2n + 1 are Fermat primes.
29) Take k = 236j+1 . obviously, (36j+2 ) = (236j+2 ) = 236j+1 . amusse (n) = 23j+1 . if n is divisible
by two distinct odd prime, then 4|(n), which means 4|236j+1 . hence, n = ps or n = 2s pt . in the first case,
(p1)ps1 = 236j+1 . obviously p = 3, s = 6j+2. in the second case, 2s1 pt1 (p1) = 236j+1 (n = 2s ,
otherwise 2s1 = 2 36j+1 ). hence s = 2, p = 3.So (n) = k has exactly two solutions when k = 2 36j+1 .

30) (1) = 1 1. when n = pk , p 3 or p = 2, k 2, (pk ) pk/2 :

(pk ) = pk1 (p 1) pk/2
pk2 (p 1)2 1
p2 3p + 1 0 and 2k2 1, k 2 support it.

similarly, when p 5 or p = 3, k 2 or p = 2, k 3, (pk ) 2 pk/2 .

hence if n is odd or 4|n,
s /2 s /2

(n) = (ps11 ps22 . . . pst t ) p11 p22

s /2

. . . pt t

if n = 2n1 , 2 - n1 and is divisible by a prime p 5 or 9:

n
(n) = ( ) 2
2

n
= n
2

n = 2n1 , 2
- n1 and cannotbe divisible by a prime p 5 or 9 means n = 2 or n = 6. obviously
(2) = 1 < 2, (6) = 2 < 6.
31) amusse a prime p such that n is divisible by p2 . then p|n, p|(n). But (n)|n 1, p|n 1. hence p|1. hence
n is square-free. if n = p1 p2 , (p1 1)(p2 1)|p1 p2 1, (p1 1)|p1 p2 1, (p1 1)|(p2 1). similarly
(p2 1)|(p1 1). p1 = p2 .
32) Induction by m. when m = 1, (m) = 1, 1|(n). it is true.
amusse for all positive integers less than m it is true. Let n = ms n1 , s 1, m - n1 .
(n) = ms1 (mn1 ) = ms1 (m)(n1 )(m, n1 )/((m, n1 ))
4

since (m, n1 )|n1 , (m, n1 ) < m, ((m, n1 ))|(n1 ). Therefore (m)|(n).

a much easier proof
since m|n, if m = pa11 pa22 . . . pas s , n = pb11 pb22 . . . pbss n1 , bi > ai , pi - n1 .
(pa11 pa22 . . . pas s ) = pa11 1 pa22 1 . . . pas s 1 (p1 1)(p2 1) . . . (ps 1)
divides

pb11 1 pb22 1 . . . pbss 1 (p1 1)(p2 1) . . . (ps 1)(n1 ) = (n)

33) Note n = pa11 pa22 . . . pas s , Ui = {m : 1 m n, pi |m}.

1 m n, (m, n) = 1 m U1 U2 . . . Us m U1 U2 . . . Us
hence,

(n) = |U1 U2 . . . Us |
= n |U1 U2 . . . Us |
s

=n
(1)j1 |Ul1 Ul2 . . . Ulj |
j=1 1l1 <l2 <<lj s

1
1
1

+
+ (1)s
= n 1
pj
pl 1 pl 2
p1 p2 . . . p s
j=1
1l1 <l2 s
(
)(
)
(
)
1
1
1
=n 1
1
... 1
p1
p2
ps

34) if n is prime or n = 1, (n) = n 1 > n n or (1) = 1 > 1 1 = 0.

if n is composite, there is a positive integer d, 1 < d < n, d|n. Let 1 < d n (if not, 1 < n/d n).

Take mi = d i, 1 i n/d, which is not relatively prime with n. Hence, (n) n n/d n n/ n =

n n

35) if nk > 1, nk+1 = (nk ) < nk for (nk , nk ) = nk .

36) f (pk ) = (pk )/pk = 1 1/p = f (p).

37) (f g)(n) = d|n f (d)g(n/d) = d|n g(d)f (n/d) = (g f )(n).

38)
((f g) h)(n) =

(f g)(d1 )h(n/d1 )

d1 |n

f (d2 )g(d1 /d2 )h(n/d1 )

d1 |n d2 |d1

f (d2 )g(d3 )h(n/d2 d3 )

d2 |n d3 |(n/d2 )

f (d2 )(g h)(n/d2 )

d2 |n

= (f (g h))(n)
39) a) if m > 1 or n > 1, 0 = (nm) = (m)(n). if m = n = 1, 1 = (mn) = (n)(m).

b) ( f )(n) = d|n f (d)(n/d) = f (n).

40) if f (1) = 0, f (1)f 1 (1) = 0.
if f (1) = 0, recursively:
{
f 1 (1) = 1/f (1)

f 1 (n) = d|n,d<n f (d)f 1 (n/d)/f (1)

5

n>1

41) if (m, n) = 1,
(f g)(mn) =

f (d)g(mn/d)

d|mn

f (d1 )f (d2 )g(m/d1 )g(n/d2 )

d1 |m d2 |n

f (d1 )g(m/d1 )

d1 |m

f (d2 )g(n/d2 )

d2 |n

= (f g)(m)(f g)(n)
42) F h = (f g) h = f (g h) = f = f .
43)
44) if n = p1 p2 . . . pr , p1 p2 . . . pr , (n) = (1)r . Hence (n) is completely multiplicative.
45) n = ps11 ps22 . . . psrr ,

(d) =

s1
s2

...

t1 =0 t2 =0

d|n

s1

(1)t1

s2

(1)t2

t2 =0

1 all si are even

0

The next questions(from 46 to 54) in exerciese 7.1 are easy.

(1)t1 +t2 +...+tr

tr =0

t1 =0

sr

The Sum and Number of Divisors

sr

(1)tr

tr =0