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 |
nList = 28:6:76;
for i = 1:length(nList)
n = nList(i);
[p1,p2] = goldbach(n)
assert(isprime(p1) && isprime(p2) && (p1+p2==n));
end
p1 =
11
p2 =
17
p1 =
17
p2 =
17
p1 =
17
p2 =
23
p1 =
23
p2 =
23
p1 =
23
p2 =
29
p1 =
29
p2 =
29
p1 =
23
p2 =
41
p1 =
29
p2 =
41
p1 =
29
p2 =
47
|
2 | Pass |
nList = [18 20 22 100 102 114 1000 2000 36 3600];
for i = 1:length(nList)
n = nList(i);
[p1,p2] = goldbach(n)
assert(isprime(p1) && isprime(p2) && (p1+p2==n));
end
p1 =
7
p2 =
11
p1 =
7
p2 =
13
p1 =
11
p2 =
11
p1 =
47
p2 =
53
p1 =
43
p2 =
59
p1 =
53
p2 =
61
p1 =
491
p2 =
509
p1 =
991
p2 =
1009
p1 =
17
p2 =
19
p1 =
1789
p2 =
1811
|
5170 Solvers
797 Solvers
223 Solvers
166 Solvers
1244 Solvers