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: 3B3C1B0E6C9A477C9E399791513169D3Standard set: High School — Functions
Original statement
Quick facts
- Statement code
- CCSS.Math.Content.HSF-IF.A.3
- List ID
- 3.
- Standard ID
- C49FF5732350418C97A63CB2DC867348
- ASN identifier
- S2554551
- Subject
- Mathematics (2010-)
- Grades
- 09, 10, 11, 12
- Ancestor IDs
- 3B3C1B0E6C9A477C9E399791513169D3B0E560D6426F43C593BEB406290D5648
- Exact matches
- Source document
- New Mexico 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.