Given the following equation: $\begin{cases} a_1 = 3 \\ a_n = 2a_{n-1} + 5 \end{cases}$ finish the following recursive function: (assume that iteration >=1)
Added by Mary S.
Close
Step 1
We want to find a recursive function that computes $a_n$ for $n \ge 1$. Show more…
Show all steps
Your feedback will help us improve your experience
Gregory Higby and 66 other AP CS 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
Write an explicit formula that represents the sequence defined by the following recursive formula: a1 = 5 and an = 3a(n-1)
Gregory H.
1. Solve the recurrence relation an = an-1 + 2n with a0 = 5.
Jiva Y.
5. (3+3 = 6 points) Give a recursive definition of the function f with n ∈ Z+. (a) f(n) = 2^n (b) f(n) = 5n + 2 6. (3+3 = 6 points) Give a recursive definition of the sequence {an} with n ∈ Z+. (a) an = 2^n (b) an = 3n - 5
Adi S.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD