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: D309BBF4D7A74AD9AA44316E9246965EStandard set: High School — Functions
Original statement
Quick facts
- Statement code
- CCSS.Math.Content.HSF-IF.A.3
- List ID
- 3.
- Standard ID
- 7590D012D0A7478AB4E9D12DB5E633EC
- ASN identifier
- S2526325
- Subject
- Mathematics (2010-2014)
- Grades
- 09, 10, 11, 12
- Ancestor IDs
- D309BBF4D7A74AD9AA44316E9246965EEDBB77E062C941408FC12FE6675A3A1E
- Exact matches
- Source document
- TN 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.