Answer to Question #277862 in Discrete Mathematics for Ripon

Question

Determine how many bit strings of length 6 can be formed, where the last bit is 0 and two consecutive 0s are not allowed.

Answer 1

The number of elements of the set of different binary strings of length 6 is $2^6=64.$

Determine the number of bit strings of length 5 that contain three consecutive 0s.

$$\begin{matrix} 0 & 0 & 0 & 0 & 0\\ 0 & 0 & 0 & 0 & 1\\ 0 & 0 & 0 & 1 & 0\\ 0 & 0 & 0 & 1 & 1\\ \\ 1 & 0 & 0 & 0 & 0\\ 1 & 0 & 0 & 0 & 1\\ \\ 0 & 1 & 0 & 0 & 0\\ 1 & 1 & 0 & 0 & 0\\ \end{matrix}$$

How many bit strings of length 6 can be formed ,where three consecutive 0s are not allowed

$$64-8=56$$