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
For the function :
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
For the function :
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
For the function :
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
a. List the algebraic operations in order of evaluation.
b. What restrictions does each operation place on the domain of the function?
c. Give the function's domain.
Khan Academy ResourcesIntro to arithmetic sequencesIntro to arithmetic sequence formulasUse arithmetic sequence formulasExtend arithmetic sequencesIntro to arithmetic sequencesArithmetic sequence problemWorked example: using recursive formula for arithmetic sequenceUsing arithmetic sequences formulasExtending arithmetic sequences
1-on-1 tutoring aligned to P.F.IF.A.7. 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 →