Waste less time on Facebook — follow Brilliant.

Generalization of a Factorial Problem

Find the smallest positive integer \(n\) such that \(n!\) has \(z\) zeroes.

Try to generalize the following problem.

Note by Swapnil Das
1 year ago

No vote yet
1 vote


Sort by:

Top Newest

In the question of Zeroes all around by Akshat Sharda, I generalize the formula as \[z = \sum_{i=1}^{\left \lfloor log_5n \right \rfloor} \left \lfloor \frac{n}{5^i} \right \rfloor\]

and Akshat Sharda himself provided that the quick approximation is \(n = 4z\). To find the exact form, it is necessary to add a few more number to this sum to find the right \(n\) Kay Xspre · 1 year ago

Log in to reply

@Kay Xspre Oh Yes !! Akshat Sharda · 1 year ago

Log in to reply

@Kay Xspre Great generalization! Swapnil Das · 1 year ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...