 Solution

ID: past-exam-of-the-mathematical-and-computational-biology-course-of-the-university-of-cambridge/2024/paper-2/a1/b/solution

A list comprehension evaluates the function for the fifty required indices:

list50 = [binet(n) for n in range(1, 51)]

Python's upper range endpoint is excluded, so 51 includes index 50. The first entries are

1, 1, 2, 3, 5, 8, 13, 21, 34, 55

, and the final entry is $F_{50} = 12586269025$ .

 New to topics? Read the docs here!