Question
Solve the recurrence relation $h_{n}=8 h_{n-1}-16 h_{n-2},(n \geq 2)$ with initial values $h_{0}=-1$ and $h_{1}=0 .$
Step 1
The given recurrence relation is $h_n = 8h_{n-1} - 16h_{n-2}$. The characteristic equation is given by: $r^2 = 8r - 16$ Show more…
Show all steps
Your feedback will help us improve your experience
Adriano Chikande and 82 other Calculus 2 / BC 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 $h_{n}=(n+2) h_{n-1},(n \geq 1)$ with initial value $h_{0}=2$.
Solve the given recurrence relation for the initial conditions given. $a_{n}=6 a_{n-1}-8 a_{n-2} ; \quad a_{0}=1, \quad a_{1}=0$
Recurrence Relations
Solving Recurrence Relations
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD