Abstract Algebra: Theory and Applications · Problem 6.5.22

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · euler-phi-function

Problem

Let n=p1e1p2e2⋯pkekn = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}, where p1,p2,…,pkp_1, p_2, \ldots, p_k are distinct primes. Prove that ϕ(n)=n(1−1p1)(1−1p2)⋯(1−1pk).\phi(n) = n\left(1 - \frac{1}{p_1}\right)\left(1 - \frac{1}{p_2}\right) \cdots \left(1 - \frac{1}{p_k}\right). Hint. If gcd⁡(m,n)=1\gcd(m,n) = 1, then ϕ(mn)=ϕ(m)ϕ(n)\phi(mn) = \phi(m)\phi(n) (Exercise 2.4.26 in Chapter 2).

Related theory

Browse the problem library