Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
m = 0;
B_correct = [1, 1];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
2 | Pass |
m = 1;
B_correct = [0.5, -0.5];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
3 | Pass |
m = 2;
B_correct = [0.1666667, 0.1666667];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
4 | Pass |
m = 4;
B_correct = [-0.0333333 -0.0333333];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
5 | Pass |
m = 8;
B_correct = [-0.0333333 -0.0333333];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
6 | Pass |
m = 12;
B_correct = [-0.2531136, -0.2531136];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
7 | Pass |
m = 16;
B_correct = [-7.0921569, -7.0921569];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
8 | Pass |
m = 20;
B_correct = [-529.1242424, -529.1242424];
[Bp,Bm] = BernoulliNumber(m);
assert(isequal([Bp,Bm],B_correct))
|
Calculate the Levenshtein distance between two strings
456 Solvers
246 Solvers
227 Solvers
51 Solvers
Numbers spiral diagonals (Part 1)
95 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!