Example: Write a recursive formula in function notation for the sequence generated by adding 5 to each successive term beginning with 2. Solution: 𝑓(1) = 2; 𝑓(𝑛) = 𝑓(𝑛 βˆ’ 1) + 5, 𝑛 > 1.

Lessons for this standard

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