Is this an acceptable proof of induction?
show that, for all n >= 2
multiply by 2 and verify the statement holds for n=2
The inductive step:
It would be a lot easier (for me, at least) to help you if you gave more detail on your steps...
I have no idea how you ended up with that for n=2 ( ...) or what you did in the final step...
for n=2 it should be:
So is true...
Now please explain in more detail the final step