 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability/2/b/i/solution

The Fibonacci recurrence, with the supplied initial values, is $F_{n + 2} = F_{n + 1} + F_{n}$ for $n \geq 0$ , with

F_{0} = 0, F_{1} = 1

. Two initial values are needed for this second-order linear recurrence relation.

 New to topics? Read the docs here!