Question

Difficulty: HardPrime Numbers and Prime Factorization

If nn is a positive integer with the prime factorization n=2a×3b×5cn = 2^a \times 3^b \times 5^c, where aa, bb, and cc are positive integers, and nn has exactly 4040 positive integer divisors, what is the minimum possible value of a+b+ca + b + c?

  1. A
    7
  2. 8Answer
  3. C
    9
  4. D
    11
  5. E
    14

Answer

8
The number of positive integer divisors of a number with prime factorization 2a×3b×5c2^a \times 3^b \times 5^c is given by (a+1)(b+1)(c+1)(a+1)(b+1)(c+1). Setting this product equal to 40 and factoring 40 into three integers greater than 1 yields two distinct sets of factors: {2,2,10}\{2, 2, 10\} and {2,4,5}\{2, 4, 5\}. The sum of the factors in {2,4,5}\{2, 4, 5\} is 2+4+5=112 + 4 + 5 = 11, which is smaller than 2+2+10=142 + 2 + 10 = 14. Subtracting 1 from each factor gives the exponents a,b,ca, b, c as 1,3,41, 3, 4, making the minimum sum a+b+c=1+3+4=8a+b+c = 1 + 3 + 4 = 8.

Step-by-Step Solution

1
Express the number of divisors of nn in terms of its exponents.
For n=2a×3b×5cn = 2^a \times 3^b \times 5^c, the total number of positive divisors is (a+1)(b+1)(c+1)=40(a+1)(b+1)(c+1) = 40.
The total divisor count formula requires taking the product of each prime factor's exponent increased by 1.
2
Find all combinations of three integers greater than 1 whose product is 40.
Since a,b,c1a, b, c \ge 1, we have a+1,b+1,c+12a+1, b+1, c+1 \ge 2. The integer factorizations of 40 into 3 factors 2\ge 2 are (2,2,10)(2, 2, 10) and (2,4,5)(2, 4, 5).
We must break down 40 into 3 integer components corresponding to (a+1)(a+1), (b+1)(b+1), and (c+1)(c+1).
3
Calculate the sum (a+1)+(b+1)+(c+1)(a+1)+(b+1)+(c+1) for each combination to find the minimum sum.
For (2,2,10)(2, 2, 10), the sum is 2+2+10=142 + 2 + 10 = 14. For (2,4,5)(2, 4, 5), the sum is 2+4+5=112 + 4 + 5 = 11. The minimum sum of factors is 11.
Minimizing (a+1)+(b+1)+(c+1)(a+1)+(b+1)+(c+1) directly minimizes a+b+ca+b+c.
4
Subtract 3 to obtain the minimum possible value of a+b+ca+b+c.
a+b+c=113=8a+b+c = 11 - 3 = 8.
Since (a+1)+(b+1)+(c+1)=(a+b+c)+3=11(a+1)+(b+1)+(c+1) = (a+b+c) + 3 = 11, subtracting 3 yields a+b+c=8a+b+c = 8.

Key Concept

Divisor Count Formula from Prime Factorization
Rate this question