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 2Parent ID: 59E4F5F26EF044869249ED3E7CC0AD95Standard set: High School — Functions
Original statement
Quick facts
- Statement code
- CCSS.Math.Content.HSF-IF.A.3
- List ID
- 3.
- Standard ID
- D236C711DD0E407D92FCE4762054A867
- ASN identifier
- S11435EB
- Subject
- Common Core Mathematics
- Grades
- 09, 10, 11, 12
- Ancestor IDs
- 59E4F5F26EF044869249ED3E7CC0AD957BD36FD0CCB701324A4B14109FE13BD5
- 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.