Let's break this down step by step.
We need
50! divided by
30^x to be a positive integer. That means
30^x must divide evenly into
50!. We want the LARGEST x possible.
Step 1: Break 30 into primes.30 =
2 ×
3 ×
5So
30^x =
2^x ×
3^x ×
5^x
This means
50! must contain AT LEAST x copies of
2, x copies of
3, AND x copies of
5.
Step 2: Count how many times each prime appears in 50!For 5s (using the
division shortcut):
50 ÷
5 =
1050 ÷
25 =
2Total =
12 fives
For 3s:50 ÷
3 =
1650 ÷
9 =
550 ÷
27 =
1Total =
22 threes
For 2s:50 ÷
2 =
2550 ÷
4 =
1250 ÷
8 =
650 ÷
16 =
350 ÷
32 =
1Total =
47 twos
Step 3: Find the bottleneck.We have
47 twos,
22 threes, and
12 fives. Since
30^x needs x of EACH prime, x can be at most as large as the SMALLEST count.
The limiting factor is
5, with only
12 copies.
So the greatest value of x is
12.
Answer: BKey Principle: When finding the highest power of a composite number that divides n!, always factor the base into primes, count each prime separately in n!, and the SMALLEST count is your bottleneck. The rarest prime always limits you — and for most problems, the largest prime factor (here,
5) will be the rarest one.