Cody

# Problem 365. Numbers with prime factors 2, 3 and 5.

Solution 1750121

Submitted on 13 Mar 2019
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; A_correct = 2; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.

2   Fail
n = 3; A_correct = [2 3]; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.

3   Fail
n = 4; A_correct = [2 3 4]; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.

4   Pass
n = 5; A_correct = [2 3 4 5]; assert(isequal(your_fcn_name(n),A_correct))

5   Fail
n = 10; A_correct = [2 3 4 5 6 8 9 10]; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.

6   Fail
n = 17; A_correct = [2 3 4 5 6 8 9 10 12 15 16]; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.

7   Fail
n = 31; A_correct = [2 3 4 5 6 8 9 10 12 15 16 18 20 24 25 27 30]; assert(isequal(your_fcn_name(n),A_correct))

Assertion failed.