Example: The Fibonacci sequence is defined recursively by 𝑓(0) = 𝑓(1) = 1, 𝑓(𝑛+1) = 𝑓(𝑛) + 𝑓(𝑛 βˆ’ 1) π‘“π‘œπ‘Ÿ 𝑛 > 1.

Lessons for this standard

Resources cannot be aligned to this standard, browse sub-standards to find lessons.