Inductive proof for recursive formula – math.stackexchange.com 11:56 Posted by Unknown 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 Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitCan a Magnetically Held Sphere Levitate in the Air – worldbuilding.stackexchange.comCan a Dementor kiss a muggle (or squib)? – scifi.stackexchange.comwhat is the farthest artificial satellite in orbit in our solar system? – space.stackexchange.comRedirect real webcam to a virtual webcam via terminal – askubuntu.comHow paradoxical that the world’s greatest chefs – ell.stackexchange.comA matrix whose all conjugates have zero diagonal must be zero? – math.stackexchange.com
0 Comment to "Inductive proof for recursive formula – math.stackexchange.com"
Post a Comment