Write the ackerman function, which conforms to 3 constraints:
ack(0, n) = n+1
ack(m, 0) = ack(m-1, 1)
ack(m, n) = ack(m-1, ack(m, n-1))
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers28
Suggested Problems
-
Project Euler: Problem 5, Smallest multiple
1673 Solvers
-
Sum of odd numbers in a matrix
620 Solvers
-
Remove All elements less than 5
145 Solvers
-
241 Solvers
-
Find remainder when x is divided by 3
167 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
See also Cody Problem 734.