Let’s define the function f(N) = n which removes all trailing zeros from N to get n, where n and N are integer numbers. For example:
f(12345) = 12345, f(678000) = 678, f(4560007) = 4560007, f(10000000) = 1 and so on.
Now, can you find :
f(100!) mod 100?
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.
No explanations have been posted yet. Check back later!