This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = bruh;
assert(isequal(bruh(x),y_correct))
|
The Goldbach Conjecture, Part 2
964 Solvers
206 Solvers
690 Solvers
Find out sum of prime number till given number
92 Solvers
97 Solvers