Binary Strings

Find the number of binary strings of length 100 which do not contain any two consecutive 1's.

Example

  • There are \(3\) binary strings of length \(2\) which do not contain any two consecutive \(1\)'s(\(00,01,10\)).
×

Problem Loading...

Note Loading...

Set Loading...