Cody

Problem 3001. Sphenic number sequence

Solution 3081286

Submitted on 6 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 = 1:5; arr_corr = [30, 42, 66, 70, 78]; assert(isequal(sphenic_seq(n),arr_corr))

arr = 30 42 66 70 78

Assertion failed.

2   Fail
n = 1:10; arr_corr = [30, 42, 66, 70, 78, 102, 105, 110, 114, 130]; assert(isequal(sphenic_seq(n),arr_corr))

arr = 30 42 66 70 78 105 110 130 154 165

Assertion failed.

3   Fail
n = 3:7; arr_corr = [66, 70, 78, 102, 105]; assert(isequal(sphenic_seq(n),arr_corr))

arr = 66 70 78 105 110

Assertion failed.

4   Fail
n = 20:30; arr_corr = [222 230 231 238 246 255 258 266 273 282 285]; assert(isequal(sphenic_seq(n),arr_corr))

arr = 230 231 238 255 266 273 285 286 290 310 322

Assertion failed.

5   Fail
n = 1:53; arr_corr = [30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, 165, 170, 174, 182, 186, 190, 195, 222, 230, 231, 238, 246, 255, 258, 266, 273, 282, 285, 286, 290, 310, 318, 322, 345, 354, 357, 366, 370, 374, 385, 399, 402, 406, 410, 418, 426, 429, 430, 434, 435, 438]; assert(isequal(sphenic_seq(n),arr_corr))

arr = 30 42 66 70 78 102 105 110 114 130 138 154 165 170 174 182 186 190 195 230 231 238 255 266 273 285 286 290 310 322 345 357 374 385 399 406 418 429 434 435 442 455 465 483 494 506 561 595 598 609 627 638 646

Assertion failed.

6   Fail
i1 = randi(20,1); n = i1:(i1+randi(25,1)); arr_tot = [30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, 165, 170, 174, 182, 186, 190, 195, 222, 230, 231, 238, 246, 255, 258, 266, 273, 282, 285, 286, 290, 310, 318, 322, 345, 354, 357, 366, 370, 374, 385, 399, 402, 406, 410, 418, 426, 429, 430, 434, 435, 438]; arr_corr = arr_tot(n); assert(isequal(sphenic_seq(n),arr_corr))

arr = 385 429 455 715 1001

Assertion failed.

Suggested Problems

More from this Author139

Community Treasure Hunt

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

Start Hunting!