Question

Difficulty: MediumProperties of Integers and Divisibility

If kk is a positive integer such that kk is divisible by 1515 and k2k^2 is divisible by 360360, what is the minimum possible number of positive divisors of kk?

  1. A
    6
  2. B
    8
  3. 12Answer
  4. D
    18
  5. E
    24

Answer

The minimum possible number of positive divisors of kk is 12.
The minimum possible number of positive divisors occurs when kk has the smallest possible prime exponents satisfying all divisibility conditions. Since 15=3×515 = 3 \times 5 divides kk, kk must have prime factors 313^1 and 515^1. For k2k^2 to be divisible by 360=23×32×51360 = 2^3 \times 3^2 \times 5^1, k2k^2 must have at least 232^3, which requires kk to have at least 22=42^2 = 4. Thus, the minimal prime factorization of kk is k=22×31×51=60k = 2^2 \times 3^1 \times 5^1 = 60. Using the divisor count formula (e1+1)(e2+1)(e3+1)(e_1 + 1)(e_2 + 1)(e_3 + 1), we get (2+1)(1+1)(1+1)=12(2+1)(1+1)(1+1) = 12 positive divisors.

Step-by-Step Solution

1
Find the prime factorizations of 15 and 360.
15=31×5115 = 3^1 \times 5^1 and 360=23×32×51360 = 2^3 \times 3^2 \times 5^1.
Expressing numbers in terms of prime factors reveals the required prime exponents for divisibility.
2
Determine the minimum exponents of the prime factors required for kk.
Since 1515 divides kk, kk must contain at least 313^1 and 515^1. For k2k^2 to be divisible by 360=23×32×51360 = 2^3 \times 3^2 \times 5^1, k2k^2 must contain at least 232^3, which means kk must contain at least 222^2. The required factors 323^2 and 515^1 in k2k^2 are automatically provided since (31)2=32(3^1)^2 = 3^2 and (51)2=52(5^1)^2 = 5^2. Thus, the minimal kk is 22×31×51=602^2 \times 3^1 \times 5^1 = 60.
Taking the minimum required exponent for each prime factor minimizes the total number of divisors of kk.
3
Calculate the number of positive divisors of the minimal kk.
The number of divisors for k=22×31×51k = 2^2 \times 3^1 \times 5^1 is (2+1)(1+1)(1+1)=3×2×2=12(2 + 1)(1 + 1)(1 + 1) = 3 \times 2 \times 2 = 12.
The divisor count formula adds 1 to each prime exponent and multiplies the results.

Key Concept

Properties of Integer Divisibility and Divisor Counting
Estimated Time:1m 30s
Rate this question