Church encoded numeral is a function which takes two arguments f and x and applies f to x several times.
For example, if c is a church numeral 3, then the following holds. c(f,x) = f(f(f(x)))
Write a function named church(n). Input n is an nonnegative integer. Output is the church encoded numeral of n.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers36
Suggested Problems
-
Find the numeric mean of the prime numbers in a matrix.
9160 Solvers
-
Project Euler: Problem 7, Nth prime
1774 Solvers
-
11204 Solvers
-
How long is the longest prime diagonal?
412 Solvers
-
Find out sum and carry of Binary adder
1779 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Learned something!