Friday, 29 April 2016

proof verification - Prove using induction that (2n)+1=2

I needed help proving this statement, this is what I have tried so far




Base case:



n=2



5<9 > True



Inductive step:



Assume that for some k>=2 , (2k)+1<3k show that P(k+1) holds




-> 2^(k+1) + 1
-> 2*(2^k) + 1
-> (1+1)*(2^k) + 1
-> 2^k + 2^k + 1
< 2^k + 3^k


This is where I get stuck I am not sure where to go from there or how to manipulate that to get 3^(k+1)



Any help would be appreciated thank you

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...