Common Core Math Functions: F-IF.A.3

CodeHS Lessons

Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ≥ 1. (

AP Computer Science A (Nitro)

Standard

10.1 Recursion

AP Computer Science A (Mocha)

Standard

8.6 Advanced: Recursion

Arizona Software and App Design II

Standard

9.6 Recursion

Nevada Computer Science 2

Standard

9.6 Advanced: Recursion

Hour of Code: Explore Blockchain Technology

Standard

IB Computer Science Standard Level

Standard

17.1 Recursion

IB Computer Science Higher Level (Year One)

Standard

15.1 Recursion

Texas Computer Science 2

Standard

9.6 Advanced: Recursion