M.A18.24
Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. 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.
Example Problems
Priya is writing an explicit function for the geometric sequence:
She comes up with:
What domain should Priya use for t, where n is an integer, so it generates the sequence?
She comes up with:
What domain should Priya use for t, where n is an integer, so it generates the sequence?
Ethan is writing an explicit function for the geometric sequence:
He comes up with:
What domain should Ethan use for t, where n is an integer, so it generates the sequence?
He comes up with:
What domain should Ethan use for t, where n is an integer, so it generates the sequence?
Kiara is writing an explicit function for the geometric sequence:
She comes up with:
What domain should Kiara use for t, where n is an integer, so it generates the sequence?
She comes up with:
What domain should Kiara use for t, where n is an integer, so it generates the sequence?
1-on-1 AI tutoring aligned to M.A18.24. Instant help for students, real-time insights for teachers.
Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.
Free for teachers, forever →