Cody

Problem 44071. Smallest n, for n! to have m trailing zero digits

Solution 1253856

Submitted on 20 Aug 2017 by Chris Cleveland
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
m = 1; n_correct = 5; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1
2   Pass
m = 2; n_correct = 10; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1
3   Pass
m = 6; n_correct = 25; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1
4   Pass
m = 5; n_correct = 25; assert(isequal(factorialForZeros(m),n_correct))
5   Pass
m = 4; n_correct = 20; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1
6   Pass
m = 156; n_correct = 625; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1
7   Pass
m = 155; n_correct = 625; assert(isequal(factorialForZeros(m),n_correct))
8   Pass
m = 154; n_correct = 625; assert(isequal(factorialForZeros(m),n_correct))
9   Pass
m = 153; n_correct = 625; assert(isequal(factorialForZeros(m),n_correct))
10   Pass
m = 152; n_correct = 620; assert(isequal(factorialForZeros(m),n_correct))

ans = logical 1

Suggested Problems

More from this Author9