Problem 44071. Smallest n, for n! to have m trailing zero digits
Solution Stats
Problem Comments
Solution Comments
-
1 Comment
I think this is (so far) the most efficient solution for large m. It requires at most log(4*m)/log(5) iterations; while the smaller sized solutions that have been suggested require at least 0.8*m iterations (or a very large array). For example, for m = 10^5, this solution takes at most 8 iterations while the other solutions of smaller size require at least 80,000 iterations.
Problem Recent Solvers41
Suggested Problems
-
1389 Solvers
-
All your base are belong to us
486 Solvers
-
Convert a numerical matrix into a cell array of strings
932 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
370 Solvers
-
Sum the 'edge' values of a matrix
285 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!