Soru

Zorluk: ZorFactors, Multiples, and Prime Factorization

A positive integer NN is divisible by 1010. The sum of all distinct prime factors of NN is 1010, and NN has exactly 1212 positive factors. What is the smallest possible value of NN?

Cevap: 60

Cevap

The smallest possible value of NN is 6060.
Because NN is divisible by 1010, its prime factorization must contain 22 and 55. The sum of all distinct prime factors is 1010, which requires 2+5+p=102 + 5 + p = 10, giving p=3p = 3. Hence, N=2a×3b×5cN = 2^a \times 3^b \times 5^c with a,b,c1a, b, c \ge 1. The number of factors is (a+1)(b+1)(c+1)=12(a+1)(b+1)(c+1) = 12. The unique product representation of 1212 using three integers 2\ge 2 is 3×2×23 \times 2 \times 2, meaning the exponents are one 22 and two 11 s. Minimizing NN requires assigning the highest exponent 22 to the smallest prime 22, giving N=22×31×51=60N = 2^2 \times 3^1 \times 5^1 = 60.

Adım Adım Çözüm

1
Identify the distinct prime factors of NN
The distinct prime factors are 2,3,2, 3, and 55.
Divisibility by 1010 implies 22 and 55 are prime factors of NN. The sum of distinct prime factors is 1010, so the remaining prime factor is 10(2+5)=310 - (2 + 5) = 3.
2
Determine the exponents in the prime factorization of NN
The set of exponents {a,b,c}\{a, b, c\} must be {2,1,1}\{2, 1, 1\}.
The total number of factors is (a+1)(b+1)(c+1)=12(a+1)(b+1)(c+1) = 12. Since a,b,c1a, b, c \ge 1, the only integer partition of 1212 into three factors 2\ge 2 is 3×2×23 \times 2 \times 2.
3
Assign exponents to minimize the value of NN
N=22×31×51=60N = 2^2 \times 3^1 \times 5^1 = 60.
To minimize NN, the largest exponent 22 must be assigned to the smallest prime base 22.

Anahtar Kavram

Prime factorization, distinct prime factor properties, and total factor count formula
Bu soruyu puanla