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 TerkaitDoes JFK offer gate passes for unaccompanied minor? – travel.stackexchange.comListing character traits – writing.stackexchange.comHow do I get my readers through the early, "hardship" part of my fiction? – writing.stackexchange.comTransform letters in a string – codereview.stackexchange.comHow to declare a "bracket-style" math operator – tex.stackexchange.comIs immorality just irrationality? – philosophy.stackexchange.com
0 Comment to "Inductive proof for recursive formula – math.stackexchange.com"
Post a Comment