Use a tree diagram to find the number of bit strings of length 4 with no 3 consecutive 0s.
Follow Math Help Forum on Facebook and Google+
Originally Posted by dh214 Use a tree diagram to find the number of bit strings of length 4 with no 3 consecutive 0s. Where are you stuck? The tree diagram should be straight forward to draw ....
View Tag Cloud