Let n = p2q, where p and q are distinct prime numbers. How many numbers m…
GATE · 2005 · IT
Let n = p2q, where p and q are distinct prime numbers. How many numbers m satisfy 1 ≤ m ≤ n and gcd(m, n) = 1? Here gcd(m, n) denotes 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)
Attempted by 119 students.
Sign up free to check your answer
Sign up freeLoading lesson…