Soru

Zorluk: Çok zorProperties of Integers and Divisibility

Let N=2a3b5cN = 2^a \cdot 3^b \cdot 5^c, where aa, bb, and cc are positive integers such that NN is a multiple of 88. If N2N^2 has 105105 distinct positive divisors and N6\frac{N}{6} has 1212 distinct positive divisors, how many distinct positive divisors does 10N10N have?

  1. A
    30
  2. B
    36
  3. 45Cevap
  4. D
    48
  5. E
    60

Cevap

The number of distinct positive divisors of 10N10N is 45.
The correct answer is 45. Given N=2a3b5cN = 2^a \cdot 3^b \cdot 5^c, the number of positive divisors of N2=22a32b52cN^2 = 2^{2a} \cdot 3^{2b} \cdot 5^{2c} is (2a+1)(2b+1)(2c+1)=105(2a+1)(2b+1)(2c+1) = 105. The unique factor decomposition of 105 into three factors greater than 1 is 3×5×73 \times 5 \times 7. Because NN is a multiple of 8, a3a \ge 3, so 2a+172a+1 \ge 7, forcing 2a+1=72a+1 = 7, which means a=3a = 3. The remaining factor set {2b+1,2c+1}={3,5}\{2b+1, 2c+1\} = \{3, 5\} gives two cases for (b,c)(b, c): (2,1)(2, 1) or (1,2)(1, 2). For N6=2a13b15c\frac{N}{6} = 2^{a-1} \cdot 3^{b-1} \cdot 5^c, the divisor count is ab(c+1)=3b(c+1)=12a \cdot b \cdot (c+1) = 3 \cdot b \cdot (c+1) = 12, so b(c+1)=4b(c+1) = 4. Substituting (b,c)=(2,1)(b, c) = (2, 1) yields 2×2=42 \times 2 = 4, which satisfies this relation. Therefore, (a,b,c)=(3,2,1)(a, b, c) = (3, 2, 1). Now 10N=2a+13b5c+1=24325210N = 2^{a+1} \cdot 3^b \cdot 5^{c+1} = 2^4 \cdot 3^2 \cdot 5^2. Its total number of positive divisors is (4+1)(2+1)(2+1)=5×3×3=45(4+1)(2+1)(2+1) = 5 \times 3 \times 3 = 45.

Adım Adım Çözüm

1
Express the divisor count formula for N2N^2
d(N2)=(2a+1)(2b+1)(2c+1)=105d(N^2) = (2a+1)(2b+1)(2c+1) = 105
For an integer with prime factorization p1e1p2e2p_1^{e_1} p_2^{e_2} \cdots, the number of divisors is (e1+1)(e2+1)(e_1+1)(e_2+1)\cdots. Here N2=22a32b52cN^2 = 2^{2a} \cdot 3^{2b} \cdot 5^{2c}.
2
Determine the value of aa using the divisibility condition
a=3a = 3
Since NN is a multiple of 8=238 = 2^3, we must have a3a \ge 3, which implies 2a+172a+1 \ge 7. The prime factorization of 105105 into three odd factors greater than 11 is 3×5×73 \times 5 \times 7. Thus, 2a+1=72a+1 = 7, giving a=3a = 3.
3
Solve for exponents bb and cc using the divisor count of N6\frac{N}{6}
b=2b = 2 and c=1c = 1
Since N6=2a13b15c\frac{N}{6} = 2^{a-1} \cdot 3^{b-1} \cdot 5^c, its divisor count is ab(c+1)=3b(c+1)=12a \cdot b \cdot (c+1) = 3b(c+1) = 12, so b(c+1)=4b(c+1) = 4. From step 2, {2b+1,2c+1}={3,5}\{2b+1, 2c+1\} = \{3, 5\}, so either (b,c)=(2,1)(b, c) = (2, 1) or (b,c)=(1,2)(b, c) = (1, 2). Testing (b,c)=(2,1)(b, c) = (2, 1) gives 2(1+1)=42(1+1) = 4, which satisfies the equation.
4
Calculate the prime factorization and divisor count of 10N10N
d(10N)=(4+1)(2+1)(2+1)=45d(10N) = (4+1)(2+1)(2+1) = 45
Since 10N=25(233251)=24325210N = 2 \cdot 5 \cdot (2^3 \cdot 3^2 \cdot 5^1) = 2^4 \cdot 3^2 \cdot 5^2, applying the divisor formula yields 5×3×3=455 \times 3 \times 3 = 45.

Anahtar Kavram

Divisor Count Formula & Prime Factorization Constraints
Tahmini Süre:2m 30s
Bu soruyu puanla