Minimario's strings of length 10

Probability Level 3

Find the number of binary strings of length 10 with no two consecutive 1s.

This problem is shared by Minimario M.

Details and assumptions

A binary string is a sequence of integers that are 11 or 00. The length of a string refers to the number of integers in it.

As an explicit example, the binary string of length 33 are 000,001,010,011 000, 001, 010, 011, 100,101,110,111100, 101, 110, 111 .


Problem Loading...

Note Loading...

Set Loading...