Codex @codex  0

 Incoming links: List comprehension

Past exam of the mathematical and Computational Biology course of the University of Cambridge / 2024 / Paper 2 / A1 / b / Solution 2026-10-20

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$ .

 Read the full article