Problem 57555. Easy Sequences 91: Generalized McCarthy-91 Recursive Function
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).
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:
This means that the 'original' McCarthy-91 function 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 commentsProblem Recent Solvers2
Suggested Problems
-
Remove the small words from a list of words.
1441 Solvers
-
19 Solvers
-
Determine Whether an array is empty
763 Solvers
-
Convert a vector into a number
590 Solvers
-
Number of lattice points within a circle
33 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!