Let n = p2q, where p and q are distinct prime numbers. How many numbers m satisfy 1 ≤ m ≤ n and gcd (m, n) = 1? Note that gcd (m, n) is the greatest common divisor of m and n.
(A) p(q – 1)
(B) pq
(C) (p2- 1) (q – 1)
(D) p(p – 1) (q – 1)
Answer: (D)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post