The rule we use. Each zero at the end is one factor of 10=2×5. So
number of zeros at the end=the smaller of (number of 2s, number of 5s)
in the prime factorisation. By the Fundamental Theorem of Arithmetic the factorisation is unique, so this count is fixed.
(i)
210×32×57
There are ten 2s and seven 5s. Each 10 uses one of each, so we can make only seven 10s — the 5s run out first.
210×32×57=23×32×(2×5)7=72×107
72 does not end in 0, so the number ends with exactly 7 zeros.
(ii)
Factorise each base first:
125=(22×3)5=210×35
155=(3×5)5=35×55
Multiply:
125×155=210×310×55
Ten 2s, five 5s — the 5s run out first.
Answer: 5 zeros.
(iii) Zeros at the end of 1×2×⋯×30
Count the 5s. Only multiples of 5 contribute a 5:
5, 10, 15, 20, 25, 30
That is 6 numbers, each giving at least one 5. But 25=52 gives two 5s, so add one more:
number of 5s=6+1=7
Why counting 5s is enough. Every even number gives at least one 2, and there are 15 even numbers from 1 to 30 — already more than 7. (In fact there are 26 factors of 2.) The 2s never run out first, so the 5s decide the answer.
Answer: the product ends with 7 zeros.
The common slip is to answer 6, forgetting that 25 contributes two 5s.
(iii) OR — the smallest k
23×55
has three 2s and five 5s, so at present it ends with only 3 zeros. For exactly 5 zeros we need five 2s and five 5s, with no extra 5s that could pair up further.
So k must supply two more 2s:
k=22=4
23×55×4=25×55=105=100000
which ends with exactly 5 zeros ✓. No smaller k works: k=1,2,3 give fewer than five 2s.
Answer: k=4.