Question

Difficulty: HardProperties of Integers and Divisibility

Let nn be a positive integer of the form n=2a3bn = 2^a \cdot 3^b, where aa and bb are positive integers. If nn is divisible by 66 and n2n^2 has exactly 3535 positive divisors, how many positive divisors does 6n6n have?

  1. A
    12
  2. B
    18
  3. 20Answer
  4. D
    24
  5. E
    70

Answer

The integer 6n6n has 20 positive divisors.
The correct answer is 20. Since n=2a3bn = 2^a \cdot 3^b, we have n2=22a32bn^2 = 2^{2a} \cdot 3^{2b}. The number of divisors of n2n^2 is (2a+1)(2b+1)=35(2a+1)(2b+1) = 35. Given nn is divisible by 6, a,b1a, b \ge 1, which means 2a+132a+1 \ge 3 and 2b+132b+1 \ge 3. The factorizations of 35 are 5×75 \times 7 and 7×57 \times 5, giving exponent values of 2 and 3. Then 6n=2a+13b+16n = 2^{a+1} \cdot 3^{b+1}, which has (a+2)(b+2)=(2+2)(3+2)=20(a+2)(b+2) = (2+2)(3+2) = 20 positive divisors.

Step-by-Step Solution

1
Express n2n^2 in terms of its prime factorization.
n2=(2a3b)2=22a32bn^2 = (2^a \cdot 3^b)^2 = 2^{2a} \cdot 3^{2b}
Squaring an integer doubles the exponents of its prime factors.
2
Set up the equation for the number of positive divisors of n2n^2.
(2a+1)(2b+1)=35(2a + 1)(2b + 1) = 35
The number of positive divisors of p1e1p2e2p_1^{e_1} p_2^{e_2} is given by (e1+1)(e2+1)(e_1 + 1)(e_2 + 1).
3
Solve for the exponents aa and bb given that nn is divisible by 6.
Since nn is divisible by 6, both a1a \ge 1 and b1b \ge 1. Thus 2a+1>12a + 1 > 1 and 2b+1>12b + 1 > 1. The only factor pairs of 35 into two integers greater than 1 are 5×75 \times 7 or 7×57 \times 5. Therefore, {2a+1,2b+1}={5,7}\{2a+1, 2b+1\} = \{5, 7\}, which yields {a,b}={2,3}\{a, b\} = \{2, 3\}.
Divisibility by 6 guarantees both prime factors 2 and 3 are present in nn.
4
Find the prime factorization of 6n6n and calculate its number of positive divisors.
6n=(2131)(2a3b)=2a+13b+16n = (2^1 \cdot 3^1) \cdot (2^a \cdot 3^b) = 2^{a+1} \cdot 3^{b+1}. Using {a,b}={2,3}\{a, b\} = \{2, 3\}, the exponents are a+1a+1 and b+1b+1, which equal 3 and 4 (in either order). The number of divisors is (3+1)(4+1)=4×5=20(3+1)(4+1) = 4 \times 5 = 20.
Adding 1 to each exponent in nn gives the exponents for 6n6n, leading to (a+2)(b+2)=(2+2)(3+2)=20(a+2)(b+2) = (2+2)(3+2) = 20.

Key Concept

Divisor Count Formula and Prime Factorization Constraints
Estimated Time:2m 0s
Rate this question