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 Solvers60
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
52850 Solvers
-
432 Solvers
-
Back to basics - mean of corner elements of a matrix
462 Solvers
-
Height of a right-angled triangle
2019 Solvers
-
9332 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!
