Cody

# Problem 46054. Count trailing zeros in a primorial

Solution 2747062

Submitted on 28 Jul 2020
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
n = 1; y_correct = 0; assert(isequal(primorialTrailingZeros(n),y_correct))

2   Pass
n = 2; y_correct = 0; assert(isequal(primorialTrailingZeros(n),y_correct))

3   Pass
n = 5; y_correct = 1; assert(isequal(primorialTrailingZeros(n),y_correct))

4   Pass
n = 10; y_correct = sin((n+3)*pi/2); assert(isequal(primorialTrailingZeros(n),y_correct))

5   Pass
n = 100; y_correct = sum(1./2.^(1:n)); assert(isequal(primorialTrailingZeros(n),y_correct))

6   Fail
n = 1e4; y_correct = besselj(mod(n,10),prod(num2str(n)'-'0')); assert(isequal(primorialTrailingZeros(n),y_correct))

Index exceeds the number of array elements (9592). Error in primorialTrailingZeros (line 3) x = x( 1: n ); Error in Test6 (line 3) assert(isequal(primorialTrailingZeros(n),y_correct))

7   Fail
n = 1e6; f = [factor(log10(n)) 3 7 7 89]; y_correct = length(primes(n))/prod(f); assert(isequal(primorialTrailingZeros(n),y_correct))

Index exceeds the number of array elements (9592). Error in primorialTrailingZeros (line 3) x = x( 1: n ); Error in Test7 (line 4) assert(isequal(primorialTrailingZeros(n),y_correct))

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!