Problem 44071. Smallest n, for n! to have m trailing zero digits
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 commentsProblem Recent Solvers49
Suggested Problems
-
Convert from Base 10 to base 5
253 Solvers
-
538 Solvers
-
805 Solvers
-
495 Solvers
-
474 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!