Given that f (0) = 1, f (1 ) = 2, f ( n ) = 2 f ( n ? 2) for n ? 2 is a recursiv
ID: 3419596 • Letter: G
Question
Given that f(0) = 1, f(1) = 2, f(n) = 2f(n ? 2) for n ? 2 is a recursive definition of a function f from the set of nonnegative integers to the set of integers. If f is well defined, find a formula for f(n) when n is a nonnegative integer and prove that the formula is valid.
a) Identify the formula for f(n)
Which one is correct
5. The definition is not valid
b) Identify the proof for the formula for f(n), obtained in part (a), using mathematical induction
Which one is correct
1. The definition is not valid
Explanation / Answer
part A (1)
Part B (4)