Problem 44071. Smallest n, for n! to have m trailing zero digits
64.0% Correct | 36.0% Incorrect
Last Solution submitted on Jan 27, 2023
yurenchu on 7 Mar 2017
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 Solvers42
Omit columns averages from a matrix
Output any real number that is neither positive nor negative
Integer Sequence - II : New Fibonacci
More from this Author9
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!