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: CB10C5A98E1F416A84582BB0A408827BStandard set: Grades 9, 10, 11, 12
Original statement
Quick facts
- Statement code
- CCSS.Math.Content.HSF-IF.A.3
- List ID
- 3.
- Standard ID
- 98DF9A058BC4450598D61B3FEDC2FF90
- ASN identifier
- S2526325
- Subject
- Mathematics (2010-2014)
- Grades
- 09, 10, 11, 12
- Ancestor IDs
- CB10C5A98E1F416A84582BB0A408827B9B21697C6AD742258716FF6B3D1E919B93A7893D9E2C42D2ACC5BC44A934DF41
- 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.