Question

Difficulty: EasyGreatest Common Divisor (GCD) and Least Common Multiple (LCM)

What is the number of distinct prime factors of the greatest common divisor (GCD) of 6060 and 9090?

  1. A
    2
  2. 3Answer
  3. C
    4
  4. D
    5
  5. E
    30

Answer

3
The prime factorization of 60 is 22×3×52^2 \times 3 \times 5 and the prime factorization of 90 is 2×32×52 \times 3^2 \times 5. The GCD is obtained by taking the lowest exponent for each common prime base: GCD(60,90)=21×31×51=30\text{GCD}(60, 90) = 2^1 \times 3^1 \times 5^1 = 30. The distinct prime factors of 30 are 2, 3, and 5, yielding a count of 3.

Step-by-Step Solution

1
Find the prime factorizations of 60 and 90.
60=22×31×5160 = 2^2 \times 3^1 \times 5^1 and 90=21×32×5190 = 2^1 \times 3^2 \times 5^1
Expressing numbers as products of prime factors is the standard method for finding their GCD.
2
Determine the GCD by taking the lowest power of each common prime factor.
GCD(60,90)=2min(2,1)×3min(1,2)×5min(1,1)=21×31×51=30\text{GCD}(60, 90) = 2^{\min(2,1)} \times 3^{\min(1,2)} \times 5^{\min(1,1)} = 2^1 \times 3^1 \times 5^1 = 30
The GCD takes the common prime bases raised to their minimum respective exponents.
3
Identify and count the distinct prime factors of 30.
The distinct prime factors of 30 are 2, 3, and 5, giving a total of 3 prime factors.
By prime definition, 1 is excluded from the list of prime factors.

Key Concept

Greatest Common Divisor (GCD) and Prime Factorization
Estimated Time:1m 0s
Rate this question