Saturday, May 14, 2016

discrete mathematics - Mathematical induction for particular formula.

I'm currently learning mathematical induction, but I'm not sure how to start a proof for this formula(the problem is different than what I've been practicing with). I'm not looking for the whole solution I'm just stumped on how to structure the proof for the following formula: $a_n = 3\cdot 2^n-1$, for all integers $n \geq 1$.



Any help would be greatly appreciated

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...