Soru

Zorluk: OrtaPrime Numbers and Prime Factorization

Let N=24×33×52×7N = 2^4 \times 3^3 \times 5^2 \times 7. How many positive integer divisors of NN are even, divisible by 15, but not divisible by 9?

Cevap: 16

Cevap

16
Any divisor of N=24×33×52×71N = 2^4 \times 3^3 \times 5^2 \times 7^1 takes the form 2a×3b×5c×7d2^a \times 3^b \times 5^c \times 7^d. The condition that the divisor is even requires a1a \ge 1, which gives 4 choices (a{1,2,3,4}a \in \{1, 2, 3, 4\}). The condition that the divisor is divisible by 15 requires b1b \ge 1 and c1c \ge 1. The condition that it is not divisible by 9 requires b<2b < 2. Together, b1b \ge 1 and b<2b < 2 mean b=1b = 1 (1 choice). The condition c1c \ge 1 allows c{1,2}c \in \{1, 2\} (2 choices). The exponent dd can be 0 or 1 (2 choices). Multiplying these choices gives 4×1×2×2=164 \times 1 \times 2 \times 2 = 16.

Adım Adım Çözüm

1
Express the general prime factorization of a divisor
d=2a×3b×5c×7dd = 2^a \times 3^b \times 5^c \times 7^d with 0a40 \le a \le 4, 0b30 \le b \le 3, 0c20 \le c \le 2, 0d10 \le d \le 1
Any divisor of NN must consist only of the prime factors of NN up to their respective maximum powers.
2
Apply the condition for even numbers
a{1,2,3,4}a \in \{1, 2, 3, 4\} (4 choices)
An even integer must contain at least one factor of 2.
3
Apply the condition for divisibility by 15 and non-divisibility by 9
b=1b = 1 (1 choice) and c{1,2}c \in \{1, 2\} (2 choices)
Divisibility by 15=3×515 = 3 \times 5 requires b1b \ge 1 and c1c \ge 1. Non-divisibility by 9=329 = 3^2 requires b<2b < 2. Thus bb must be exactly 1.
4
Apply the condition for the exponent of 7
d{0,1}d \in \{0, 1\} (2 choices)
There are no restrictions given for prime factor 7.
5
Calculate the product of choices
4×1×2×2=164 \times 1 \times 2 \times 2 = 16
By the fundamental counting principle, the total number of valid combinations of prime exponents is the product of the number of choices for each exponent.

Anahtar Kavram

Counting Divisors with Prime Factorization Restrictions
Bu soruyu puanla