Sign inSign in

Fibonacci recurrence

A recurrence where the term for year n is the sum of the term from the previous year and the term from two years prior, f(n) = f(n-1) + f(n-2).
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.