Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2015/discrete-mathematics-continuous-mathematics-and-probability/2/e/iii/solution

Use mathematical induction with two base cases. At , the formula gives . At , it gives .
If it holds at and , then the Fibonacci recurrence gives
The identities and turn the numerator into . Thus

New to topics? Read the docs here!