Recognize sequences, including recursive sequences, as functions whose domains are subsets of integers.
Model a finite list as a sequence function
Problem
Determine whether the finite list \(8,~11,~14\) can be modeled as a sequence function, and state an input assignment.
Big Picture
What this problem is really about
A sequence may be finite as long as its outputs are ordered and indexed. We’ll assign consecutive integer term numbers to the listed values in their given order, state the finite domain explicitly, and write the resulting input-output mappings. Verifying one output per term number will confirm whether the assignment defines a function.
Inside Gozunta
Turn the preview into practice.
More than a preview
Gozunta lets you study this problem—and more than 10,000 others.
Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.
