I have no idea what you think the problem actually says.
BUT .
Why don't you quote the problem exactly as it was given to you?
Im trying solve 2 questions using induction.
Problem 1.
n equals 2^n where n is length of bit string (For example if n = 1, then only 0 and 1 are possible outcomes).
Base Case: Assume n = 1, therefore 2^1 = 2. Which is correct as i described above.
Induction Case: I get alittle troubled by something now..
Show that P(n) holds then so does P(n+1).
n, (n+1) = 2^(n+1)
Now I rearrange the RHS correct?
= (2n + 2)
=2(n+1)
Can somebody help me out if im on the right track on this?
Problem 2.
Similar problem but the numbers of binary words of length at most n is equal to 2^(n+1) - 1.
Base Case: n = 1
So 2^(1+1)-1 = 3
Shouldnt it be 2?
I know that both of these are correct i just have to prove them, but my mind gets muddled as i described above and id love some clarification if possible.
(Actually it could be that i need to prove them false).
Thanks for giving me your generous help.