Inductive proof for recursive formula – math.stackexchange.com

Inductive proof for recursive formula – math.stackexchange.com

11:56 No Comments
So, I have a recursion in which $$a_0 = 5$$ $$a_1 = 1$$ $$a_{n+2} = a_{n+1} + 2a_n$$ I should then prove by induction that the formula $a_n = 2^{n+1} + 3(-1)^n$ works for every number. Anyway, I ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Inductive proof for recursive formula – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)