This problem’s question: How many zeros at the low order end of 1 000 000 000 000 000 000!?
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.
1 2 3 4 5 6 |
|
1 |
|
Correct. Actually, our methods are quite similar.
Yes. My program pretty much automatically computes the values you have written out making it less tedious for me.
The first line by itself is my entire program. I then wrote out the intermediate values and entered them into an addition problem written in L A T E X to help others understand what ∑ n = 1 2 5 ⌊ 5 n 1 0 1 8 ⌋ did. That program is as written in Wolfram Mathematica 12.
Problem Loading...
Note Loading...
Set Loading...
∑ n = 1 2 5 ⌊ 5 n 1 0 1 8 ⌋ ⇒ 2 4 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 5 .
2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 6 4 0 0 0 0 0 0 0 0 0 0 0 0 1 2 8 0 0 0 0 0 0 0 0 0 0 0 2 5 6 0 0 0 0 0 0 0 0 0 0 5 1 2 0 0 0 0 0 0 0 0 0 1 0 2 4 0 0 0 0 0 0 0 0 2 0 4 8 0 0 0 0 0 0 0 4 0 9 6 0 0 0 0 0 0 8 1 9 2 0 0 0 0 0 1 6 3 8 4 0 0 0 0 3 2 7 6 8 0 0 0 6 5 5 3 6 0 0 1 3 1 0 7 2 0 2 6 2 1 4 4 5 2 4 2 8 1 0 4 8 5 2 0 9 7 4 1 9 8 3 1 6 + 3 2 4 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 5