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 Solvers63
Suggested Problems
-
Convert a numerical matrix into a cell array of strings
2562 Solvers
-
Return elements unique to either input
817 Solvers
-
How long is the longest prime diagonal?
414 Solvers
-
906 Solvers
-
Write c^3 as sum of two squares a^2+b^2
331 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!
