The McCarthy 91 function is a recursive function, defined by the computer scientist John McCarthy as a test case for formal verification within computer science.
The McCarthy 91 function is defined for integer n as:
Remarkably, the function yields 
for all 
(hence, the function name).
for all (hence, the function name).A more generalized form of the McCarthy's recursive function is defined below:
For positive integers a, b, c, k, and n.
The expression 
, means applying the function G, k number of times:
, means applying the function G, k number of times:
This means that the 'original' McCarthy-91 function 
is actually 
, with 
, 
, 
and 
.
is actually , with , , and .Given integers, a, b, c, k, and n, evaluate the value of .
.--------------------
NOTE: The McCarthy-91 function was created to test recursive function implementations. In this problem, while iterative loops are allowed, use of recursion is encouraged.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
415 Solvers
-
Replace multiples of 5 with NaN
470 Solvers
-
Find out sum of prime number till given number
271 Solvers
-
Test Problem; Create a 5x5 array containing all ones
405 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
