Question
In Exercises 34-40, give a recursive definition of the sequence.$$f_{n}=2 n, n=1,2,3, \ldots$$
Step 1
The base case is the starting point of the sequence. In this case, when $n=1$, $f_{1}=2*1=2$. So, our base case is $f_{1}=2$. Show more…
Show all steps
Your feedback will help us improve your experience
Carson Merrill and 99 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Give a recursive definition of the sequence. $$ f_{n}=n !, n=1,2,3, \ldots $$
Basics
Functions and Their Graphs
Give a recursive definition of the sequence. $$ f_{n}=2^{n}, n=1,2,3, \ldots $$
Give a recursive definition of the sequence. $$ \left.f_{n}=2^{((-1) n}\right), n=1,2,3, \ldots $$
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD