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
Complete question :
Point K on the number line shows Kelvin's score after the first round of a quiz: A number line is shown from negative 10 to 0 to positive 10. There are increments of 1 on either side of the number line. The even numbers are labeled on either side of the number line. Point K is shown on 3. In round 2, he lost 9 points. Which expression shows how many total points he has at the end of round 2? 3 + (−6) = −9, because −9 is 6 units to the left of 3 3 + 6 = −9, because −9 is 6 units to the left of 3 3 + (−9) = −6, because −6 is 9 units to the left of 3 3 + 9 = −6, because −6 is 9 units to the left of 3
Answer: 3 + (−9) = −6, because −6 is 9 units to the left of 3
Step-by-step explanation:
Given the following :
Width of number line = - 10 to + 10
Point K on the number line = +3 ( kelvin's score after the first round of quiz).
If Kelvin losses 9 points in round 2 = - 9
Hence at the end of round 2, He'll have a total of :
Point at the end of round 1 + point lost in round 2
3 + (-9) = - 6
