Soru

Zorluk: Çok zorFactors, Multiples, and Prime Factorization

A positive integer NN has the prime factorization N=2a×3b×5cN = 2^a \times 3^b \times 5^c, where aa, bb, and cc are positive integers. The greatest common divisor of NN and 360360 has exactly 1212 positive factors, and the least common multiple of NN and 360360 has exactly 7272 positive factors. How many positive factors does NN have?

Cevap: 36

Cevap

The positive integer NN has exactly 36 positive factors.
By writing the prime factorization of 360360 as 23×32×512^3 \times 3^2 \times 5^1 and expressing the GCD and LCM of NN and 360360 in terms of the minimum and maximum exponents of their prime factors, we establish a system of equations for the exponents. Solving this system yields two cases: either a=2a = 2, b=1b = 1, and c=5c = 5, or a=1a = 1 with (b+1)(c+1)=18(b + 1)(c + 1) = 18. In both cases, the formula for the number of positive factors of NN, which is (a+1)(b+1)(c+1)(a + 1)(b + 1)(c + 1), evaluates to exactly 36.

Adım Adım Çözüm

1
Find the prime factorization of 360360.
360=23×32×51360 = 2^3 \times 3^2 \times 5^1.
This allows us to write the greatest common divisor (GCD) and least common multiple (LCM) of NN and 360360 in terms of their prime factors.
2
Express the number of factors of GCD(N,360)\text{GCD}(N, 360) using the minimum exponents.
(min(a,3)+1)(min(b,2)+1)(min(c,1)+1)=12(\min(a, 3) + 1)(\min(b, 2) + 1)(\min(c, 1) + 1) = 12. Since c1c \ge 1, we have min(c,1)=1\min(c, 1) = 1, which simplifies the equation to (min(a,3)+1)(min(b,2)+1)=6(\min(a, 3) + 1)(\min(b, 2) + 1) = 6.
The GCD of two numbers is found by taking the minimum of their exponents for each prime factor.
3
Solve for the possible values of aa and bb from the GCD factor equation.
Since a,b1a, b \ge 1, the only integer pairs for the factors of 66 are: Case 1: a=2a = 2 and b=1b = 1, or Case 2: a=1a = 1 and b2b \ge 2.
We analyze the possible values of min(a,3)\min(a, 3) and min(b,2)\min(b, 2) that multiply to 66 under the constraints a,b1a, b \ge 1.
4
Apply the LCM condition to find the number of factors of NN for both cases.
For Case 1: LCM(N,360)\text{LCM}(N, 360) has factors count (3+1)(2+1)(c+1)=72    c=5(3+1)(2+1)(c+1) = 72 \implies c = 5, giving d(N)=(2+1)(1+1)(5+1)=36d(N) = (2+1)(1+1)(5+1) = 36. For Case 2: LCM(N,360)\text{LCM}(N, 360) has factors count (3+1)(b+1)(c+1)=72    (b+1)(c+1)=18(3+1)(b+1)(c+1) = 72 \implies (b+1)(c+1) = 18, giving d(N)=(1+1)(b+1)(c+1)=2×18=36d(N) = (1+1)(b+1)(c+1) = 2 \times 18 = 36.
The LCM uses the maximum of the exponents, which allows us to relate the remaining unknown exponents to the total factor count.

Anahtar Kavram

Factors, Multiples, and Prime Factorization
Bu soruyu puanla