Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
[y numbers]=circular_prime(197)
assert(isequal(y,16)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197]))
y =
16
numbers =
2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197
|
2 | Pass |
%%
[y numbers]=circular_prime(100)
assert(isequal(y,13)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97]))
y =
13
numbers =
2 3 5 7 11 13 17 31 37 71 73 79 97
|
3 | Pass |
%%
[y numbers]=circular_prime(250)
assert(isequal(y,17)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199]))
y =
17
numbers =
Columns 1 through 16
2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197
Column 17
199
|
4 | Pass |
%%
[y numbers]=circular_prime(2000)
assert(isequal(y,27)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931]))
y =
27
numbers =
Columns 1 through 8
2 3 5 7 11 13 17 31
Columns 9 through 16
37 71 73 79 97 113 131 197
Columns 17 through 24
199 311 337 373 719 733 919 971
Columns 25 through 27
991 1193 1931
|
5 | Pass |
%%
[y numbers]=circular_prime(10000)
assert(isequal(y,33)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377]))
y =
33
numbers =
Columns 1 through 8
2 3 5 7 11 13 17 31
Columns 9 through 16
37 71 73 79 97 113 131 197
Columns 17 through 24
199 311 337 373 719 733 919 971
Columns 25 through 32
991 1193 1931 3119 3779 7793 7937 9311
Column 33
9377
|
6 | Pass |
%%
[y numbers]=circular_prime(54321)
assert(isequal(y,38)&&isequal(numbers,[2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991 1193 1931 3119 3779 7793 7937 9311 9377 11939 19391 19937 37199 39119]))
y =
38
numbers =
Columns 1 through 8
2 3 5 7 11 13 17 31
Columns 9 through 16
37 71 73 79 97 113 131 197
Columns 17 through 24
199 311 337 373 719 733 919 971
Columns 25 through 32
991 1193 1931 3119 3779 7793 7937 9311
Columns 33 through 38
9377 11939 19391 19937 37199 39119
|
Find all elements less than 0 or greater than 10 and replace them with NaN
11619 Solvers
Return the 3n+1 sequence for n
5202 Solvers
Generate N equally spaced intervals between -L and L
440 Solvers
Determine if input is a perfect number
113 Solvers
223 Solvers