Cody

# Problem 83. Prime factor digits

Solution 3154766

Submitted on 10 Oct 2020 by JB
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 = 2; p_correct = 1; assert(isequal(factor_digits(n),p_correct))

factors = 2 allps = 2 p = 1

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

factors = 13 2 allps = 13 11 7 5 3 2 p = 1 p = 1 0 p = 1 0 0 p = 1 0 0 0 p = 1 0 0 0 0 p = 1 0 0 0 0 1

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

factors = 7 3 2 2 2 allps = 7 5 3 2 p = 1 p = 1 0 p = 1 0 1 p = 1 0 1 3

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

factors = 37 3 3 3 allps = 37 31 29 23 19 17 13 11 7 5 3 2 p = 1 p = 1 0 p = 1 0 0 p = 1 0 0 0 p = 1 0 0 0 0 p = 1 0 0 0 0 0 p = 1 0 0 0 0 0 0 p = 1 0 0 0 0 0 0 0 p = 1 0 0 0 0 0 0 0 0 p = 1 0 0 0 0 0 0 0 0 0 p = 1 0 0 0 0 0 0 0 0 0 3 p = 1 0 0 0 0 0 0 0 0 0 3 0

### Community Treasure Hunt

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

Start Hunting!