ANOTHER race: ...title too long, read it!

[A$$Bandit]

So go on, the number of zeros on the end of the factorial of a suitable large number, say 10^64. It would take you a long time just to count them up from the end of the actual number on your screen...

Let's see how quickly this can be done

[bugzpodder]

?? you want us to do it by hand?

[SteveCRM]

race programs to do it?

[bugzpodder]

the question itself isn't hard but i can't do it using pen and paper.

let that huge number be k (in this case 10^64)

so number of 0 = [k/5]+[k/25]+[k/625]+...+[k/5^c] where c is the largest integer such that 5^c<k and [x] denote the largest integer function

[NotLKH]

I beleive there is an equation based on Log that does this. I think
So, anyways. Its not a worthy time waster though.

[A$$Bandit]

Hmm well looks like you all passed the intelligence test by not bothering, I really was looking forward to someone ACTUALLY trying though

[bugzpodder]

I've provided the method, you do the number crunching...

Originally posted by bugzpodder
the question itself isn't hard but i can't do it using pen and paper.

let that huge number be k (in this case 10^64)

so number of 0 = [k/5]+[k/25]+[k/625]+...+[k/5^c] where c is the largest integer such that 5^c<k and [x] denote the largest integer function

[A$$Bandit]

Well yeh, but to be honest I was trying to trick someone into actually counting them all up... so I'm a little disappointed.

[SilverSprite]

There are 64 zeros on the end of 10^64.