Beer Hunter, your logic doesn''t quite make sense to me. Of course, that could be just a fault in my brain, not yours!
For bit strings of length n...
a) there are 2n possible strings;
b) there are sumi=0n-1{2i} strings that are shorter in length than n;
c) there are twice as many strings of length n as there are of length (n-1).
Which of these facts were you using in your proof and how (exactly)?
Thanks,
Tim
