Find the smallest possible value of x such that 1 × 2 × 3 × ⋯ × x ends with 128 zeroes.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Removing the floor function and using the formula of infinite Gp, also gives a good estimate.
5
n
+
2
5
n
+
…
=
1
2
8
4
n
=
1
2
8
n
=
5
1
2
which has 126 zeroes.
515 will have 127 zeroes, and 520 will have 128 zeroes.
Same Way !
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Trailing Number of Zeros
From this problem, we want to find x such that ⌊ 5 x ⌋ + ⌊ 5 2 x ⌋ + ⌊ 5 3 x ⌋ + ⌊ 5 4 x ⌋ + ⋯ = 1 2 8 .
A good estimate is essential here.
If x = 3 0 0 then ⌊ 5 3 0 0 ⌋ + ⌊ 5 2 3 0 0 ⌋ + ⌊ 5 3 3 0 0 ⌋ = 6 0 + 1 2 + 2 = 7 4 .
If x = 4 0 0 then ⌊ 5 4 0 0 ⌋ + ⌊ 5 2 4 0 0 ⌋ + ⌊ 5 3 4 0 0 ⌋ = 8 0 + 1 6 + 3 = 9 9 .
If x = 5 0 0 then ⌊ 5 5 0 0 ⌋ + ⌊ 5 2 5 0 0 ⌋ + ⌊ 5 3 5 0 0 ⌋ = 1 0 0 + 2 0 + 4 = 1 2 4 .
We need 4 more factor 5 's, therefore x = 5 2 0 .