How many bit strings of length 12 are palindromes and contain 10 as sub string
1 answer:
There are as many palindromic 12-bit binary strings as there are permutations with repetition of 6-bit binary strings, which is equal to 
.
There are also only two permutations with repetition of 6-bit binary strings, that when each of them is mirrored and the result is "glued" to the right side of the original string, will give a palindromic string without 10 as a substring.
Those strings are 000000 and 111111.
Therefore there are
palindromic 12-bit binary strings with 10 as substring.
There are also only two permutations with repetition of 6-bit binary strings, that when each of them is mirrored and the result is "glued" to the right side of the original string, will give a palindromic string without 10 as a substring.
Those strings are 000000 and 111111.
Therefore there are
You might be interested in
Answer:
Step-by-step explanation:
In the fifth grade class, of the girls have brown hair. Again among those of the brown-haired girls,
of them have long hair.
We are asked to find the fraction of the girls who have long brown hair in the class.
The fraction of the total students which have long brown hair will be () =
. (Answer)