Recent content by Cribs1420

I am having a heck of a time with this proof. I am given both the recursive and closed formula and am supposed to prove that they are equivalent using induction. This is what I am given: bk = 3bk-1+2 for k <2 and b1=2 the closed formula is bn= 3n-1Trying to solve it this is as far as I have...