Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers.
Standard detail
CCSS.Math.Content.HSF-IF.A.3
Standard
Depth 3Parent ID: 63EF7EFCD87047B08549B3E30761E9EDStandard set: Grades 9, 10, 11, 12
Original statement
Quick facts
- Statement code
- CCSS.Math.Content.HSF-IF.A.3
- List ID
- 3.
- Standard ID
- 8FA9CBE7A73D482CB0E7DE16DD95E164
- ASN identifier
- S11435EB
- Subject
- Common Core Mathematics
- Grades
- 09, 10, 11, 12
- Ancestor IDs
- 63EF7EFCD87047B08549B3E30761E9EDD687975EC32D41F28EEAB7D695B4B34ADBC385CA20BD4319A215468CCB0FDE70
- Source document
- Common Core State Standards for Mathematics (2010)
- License
- CC BY 3.0 US
- Dataset notes
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.