# Minimario's strings of length 10

Discrete Mathematics 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 $$1$$ or $$0$$. The length of a string refers to the number of integers in it.

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

×