A binary string of length 12 is made up of 12 bits (that is, 12 symbols, each of which is a 0 or a 1). How many such strings either start with three 1’s or end in four 0’s?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.