Cody

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

Solution 2628391

Submitted on 29 Jun 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; 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   Fail
n = 5; A_correct = [2 3 4 5]; assert(isequal(your_fcn_name(n),A_correct))

current = 30 current = 60

Assertion failed.

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

current = 30 current = 90 current = 60 current = 180 current = 120 current = 360

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))

current = 30 current = 90 current = 60 current = 180 current = 120 current = 360 current = 240 current = 720

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))

current = 30 current = 150 current = 90 current = 450 current = 270 current = 1350 current = 60 current = 300 current = 180 current = 900 current = 540 current = 2700 current = 120 current = 600 current = 360 current = 1800 current = 1080 current = 5400 current = 240 current = 1200 current = 720 current = 3600 current = 2160 current = 10800

Assertion failed.