Find a closed form expression for the following recurrence relation: s0 = 1 s1 = 5 sn = 2sn-1 + 35sn-2 for n ≥ 2
Added by Cristina J.
Step 1
Step 1: First, let's write out the first few terms of the sequence to see if we can find a pattern: s0 = 1 s1 = 5 s2 = 2s1 + 35s0 = 2(5) + 35(1) = 10 + 35 = 45 s3 = 2s2 + 35s1 = 2(45) + 35(5) = 90 + 175 = 265 s4 = 2s3 + 35s2 = 2(265) + 35(45) = 530 + 1575 = 2105 Show more…
Show all steps
Close
Your feedback will help us improve your experience
Avinash Vishwakarma and 93 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
Solve the recurrence relation an = 12an-1 - 36an-2 with a0 = 5 and a1 = 12.
Avinash V.
Solve the recurrence relation sn = 2sn-1 + n^2n, where s1 = 2.
Sri K.
Recurrence Relations: (a) Suppose that we have a sequence of integers a0, a1, ... such that a0 = 5 and a1 = -6 and for n ≥ 2, an = -2an-1 + 8an-2 + 3 · 2n. Find a closed form for the n-th term of the unique sequence satisfying the recurrence.
Madhur L.
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