Given the recursive rule for an arithmetic sequence, select the explicit rule. f (0) = 3 and f (n) = f (n - 1) + 8 for n ? 1 f (n) = 3 + 8n for n ? 0 f (n) = 8 + 3n for n ? 0 f (n) = 3 + 8n for n ? 1 f (n) = 8 + 3n for n ? 1
Added by Jonathan G.
Close
Step 1
Now let's find f(1) using the recursive rule: f(1) = f(1-1) + 8 = f(0) + 8 = 3 + 8 = 11 Now let's find f(2): f(2) = f(2-1) + 8 = f(1) + 8 = 11 + 8 = 19 We can see a pattern here: f(n) = 3 + 8n Show more…
Show all steps
Your feedback will help us improve your experience
Supreeta N and 77 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
Using the recursive formula for each arithmetic sequence, find the second, third, and fourth terms of the sequence. Then write the explicit formula that represents the sequence. $A(n)=A(n-1)-4 ; A(1)=8$
An Introduction to Functions
Arithmetic Sequences
Find a function f(n) that identifies the nth term an of the following recursively defined sequences, as an = f(n). 14. a1 = 1 and an+1 = -an for n ≥ 1 15. a1 = 2 and an+1 = 2an for n ≥ 1 16. a1 = 1 and an+1 = (n + 1)an for n ≥ 1 17. a1 = 2 and an+1 = (n + 1)an/2 for n ≥ 1 18. a1 = 1 and an+1 = an/2^n for n ≥ 1
Shyam P.
Find a function $f(n)$ that identifies the $n$ th term $a_{n}$ of the following recursively defined sequences, as $a_{n}=f(n).$ $$a_{1}=2 \text { and } a_{n+1}=(n+1) a_{n} / 2 \text { for } n \geq 1$$
Sequences and Series
Sequences
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD