Question

Difficulty: Very hardFactors, Multiples, and Prime Factorization

A positive integer KK has exactly 1212 positive factors. The greatest common divisor of KK and 8484 is 66, and the least common multiple of KK and 2424 is 360360. What is the value of KK?

  1. A
    60
  2. B
    72
  3. 90Answer
  4. D
    120
  5. E
    180

Answer

90
The prime factorizations are 84=22×3×784 = 2^2 \times 3 \times 7, 6=2×36 = 2 \times 3, 24=23×324 = 2^3 \times 3, and 360=23×32×5360 = 2^3 \times 3^2 \times 5. The condition gcd(K,84)=6\gcd(K, 84) = 6 implies the power of 2 in KK is exactly 1, and the power of 3 is at least 1. The condition lcm(K,24)=360\text{lcm}(K, 24) = 360 implies the power of 3 in KK is exactly 2, and the power of 5 is exactly 1. Thus, KK must be 21×32×51=902^1 \times 3^2 \times 5^1 = 90. Testing 9090, it has (1+1)(2+1)(1+1)=12(1+1)(2+1)(1+1) = 12 positive factors, which perfectly satisfies all conditions.

Step-by-Step Solution

1
Find the prime factorization of the given numbers in the problem.
84=22×3×784 = 2^2 \times 3 \times 7, 6=2×36 = 2 \times 3, 24=23×324 = 2^3 \times 3, and 360=23×32×5360 = 2^3 \times 3^2 \times 5.
Expressing these numbers in terms of their prime components allows us to determine the constraints on the prime factorization of KK.
2
Analyze the greatest common divisor constraint gcd(K,84)=6\gcd(K, 84) = 6.
The prime 2 must have an exponent of exactly 1 in the factorization of KK (since 8484 has 222^2 and the greatest common divisor has only 212^1). The prime 3 must have an exponent of at least 1 in KK. The prime 7 cannot be a factor of KK.
The greatest common divisor selects the minimum exponent for each shared prime factor.
3
Analyze the least common multiple constraint lcm(K,24)=360\text{lcm}(K, 24) = 360.
The prime 3 must have an exponent of exactly 2 in KK (since 2424 has 313^1 and the least common multiple has 323^2). The prime 5 must have an exponent of exactly 1 in KK (since 2424 has 505^0 and the least common multiple has 515^1). KK cannot contain any prime factors other than 2, 3, and 5.
The least common multiple selects the maximum exponent for each prime factor present in either number.
4
Combine the exponent constraints to determine KK and verify its factor count.
K=21×32×51=90K = 2^1 \times 3^2 \times 5^1 = 90. The number of positive factors of 9090 is (1+1)(2+1)(1+1)=2×3×2=12(1+1)(2+1)(1+1) = 2 \times 3 \times 2 = 12.
This unique configuration matches all given greatest common divisor and least common multiple prime power requirements and satisfies the factor count condition.

Key Concept

Prime Factorization, Greatest Common Divisor, Least Common Multiple, and Number of Factors

Alternative Method

Instead of analyzing prime factor exponents, check the given multiple-choice options. Test each option by checking if it has exactly 12 factors, a greatest common divisor of 6 with 84, and a least common multiple of 360 with 24. Only the value 90 meets all three criteria.
Estimated Time:2m 30s
Rate this question