For a bit string containing 10 bits, how many strings are there that contains 5 consecutive 0s or 1s.
The OR is inclusive in this example and it is AT LEAST 5 consecutive so 6 consecutive would still count.
I don't understand how I should approach this. There are too many cases to exclude when calculating the permutation of a single case.
Get Answers For Free
Most questions answered within 1 hours.