Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
m=0;
n=1;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
ans =
2
|
2 | Pass |
m=0;
n=1024;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
ans =
1025
|
3 | Pass |
m=0;
n=randi(1024)
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
n =
967
ans =
968
|
4 | Pass |
m=1;
n=1024
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
1024
ans =
1026
|
5 | Pass |
m=1;
n=randi(1024)
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
230
ans =
232
|
6 | Pass |
m=2;
n=randi(128)
Ack = 2*n+3;
assert(isequal(ackermann(m,n),Ack))
n =
2
ans =
7
|
7 | Pass |
m=3;
n=6;
Ack = 509;
assert(isequal(ackermann(m,n),Ack))
ans =
509
|
8 | Pass |
m=3;
n=randi(6)
Ack = 2^(n+3)-3;
assert(isequal(ackermann(m,n),Ack))
n =
1
ans =
13
|
9 | Pass |
m=4;
n=0;
Ack = 13;
assert(isequal(ackermann(m,n),Ack))
ans =
13
|
10 | Pass |
m=4;
n=1; % Fails at RecursionLimit 1030; Create Special
Ack = 65533;
assert(isequal(ackermann(m,n),Ack))
ans =
65533
|
Project Euler: Problem 10, Sum of Primes
555 Solvers
167 Solvers
Generate N equally spaced intervals between -L and L
439 Solvers
313 Solvers
1391 Solvers