Discrete Structure20795 marksNumerical: recursively defined functionRecursively defined functions
What is recursively defined function? Suppose that f is defined recursively by f(0) = 3, f(n + 1) = 2f (n) +3. Find f(1), f(2), f(3), and f(4).
What is recursively defined function? Suppose that f is defined recursively by f(0) = 3, f(n + 1) = 2f (n) +3. Find f(1), f(2), f(3), and f(4). [5]
- Base case: $f(0) = 3$ - Recursive step: $f(n+1) = 2f(n) + 3$ - Required: $f(1), f(2), f(3), f(4)$ A recursively defined function is a function defined in terms of itself, using two components: 1. Base case: the value of the function at a starting argument (here $f(0) = 3$) is given explicitly. ...