Prove by induction that the number of different binary strings with n bits is 2^n Claim: That B(n) = 2^n is the no of different binary strings of length n.
computer science
Description
Prove by induction that the number of different binary strings with n bits is 2^n Claim: That B(n) = 2^n is the no of different binary strings of length n.
