Cody

# Problem 83. Prime factor digits

Solution 3459878

Submitted on 28 Oct 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   Fail
n = 2; p_correct = 1; assert(isequal(factor_digits(n),p_correct))

Error using zeros Size inputs must be scalar. Error in factor_digits (line 2) primes_list = zeros(1,size(primes(sqrt(n)))); Error in Test1 (line 3) assert(isequal(factor_digits(n),p_correct))

2   Fail
n = 26; p_correct = [1 0 0 0 0 1]; assert(isequal(factor_digits(n),p_correct))

Error using zeros Size inputs must be scalar. Error in factor_digits (line 2) primes_list = zeros(1,size(primes(sqrt(n)))); Error in Test2 (line 3) assert(isequal(factor_digits(n),p_correct))

3   Fail
n = 168; p_correct = [1 0 1 3]; assert(isequal(factor_digits(n),p_correct))

Error using zeros Size inputs must be scalar. Error in factor_digits (line 2) primes_list = zeros(1,size(primes(sqrt(n)))); Error in Test3 (line 3) assert(isequal(factor_digits(n),p_correct))

4   Fail
n = 999; p_correct = [1 0 0 0 0 0 0 0 0 0 3 0]; assert(isequal(factor_digits(n),p_correct))

Error using zeros Size inputs must be scalar. Error in factor_digits (line 2) primes_list = zeros(1,size(primes(sqrt(n)))); Error in Test4 (line 3) assert(isequal(factor_digits(n),p_correct))

### Community Treasure Hunt

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

Start Hunting!