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

Solution 1780042

Submitted on 10 Apr 2019 by Fabio Squizzato

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

Test	Status	Code Input and Output
1	Pass	n = 2; A_correct = 2; assert(isequal(your_fcn_name(n),A_correct))
2	Pass	n = 3; A_correct = [2 3]; assert(isequal(your_fcn_name(n),A_correct))
3	Pass	n = 4; A_correct = [2 3 4]; assert(isequal(your_fcn_name(n),A_correct))
4	Pass	n = 5; A_correct = [2 3 4 5]; assert(isequal(your_fcn_name(n),A_correct))
5	Pass	n = 10; A_correct = [2 3 4 5 6 8 9 10]; assert(isequal(your_fcn_name(n),A_correct))
6	Pass	n = 17; A_correct = [2 3 4 5 6 8 9 10 12 15 16]; assert(isequal(your_fcn_name(n),A_correct))
7	Pass	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))