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