Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 2 / 4H / c

The function is the predecessor function. It has the primitive recursion definitionThe initial function is the zero function and the recursion step is a projection function, both of which are primitive recursive functions. Closure under primitive recursion therefore proves that $f$ is primitive recursive.