For given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! to have at least "m" trailing zeros, what is the smallest "n" ?
Example: factorial(10) = 3628800 factorial(9) = 362880 In order to have 2 trailing zeros on factorial, the smallest n is 10.
Optional: Can you make an efficient algorithm for a very large m?
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers61
Suggested Problems
-
Find the peak 3n+1 sequence value
2568 Solvers
-
Remove the small words from a list of words.
1560 Solvers
-
Back to basics 8 - Matrix Diagonals
966 Solvers
-
Change the sign of even index entries of the reversed vector
645 Solvers
-
Height of a right-angled triangle
2021 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
