For example, the Fibonacci sequence is defined recursively by 𝘧(0) = 𝘧(1) = 1, 𝘧(𝘯 + 1) = 𝘧(𝘯) + 𝘧(𝘯 βˆ’ 1) for 𝘯 greater than or equal to 1.

Lessons for this standard

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