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:
Given that to save money, a local charity organization wants to target its mailing requests for donations to individuals who are most supportive of its cause.
Men women
Sample size 5 5
Mean rate 6.2 5.3
Mean diffference =
Std error for difference = 0.25 (given)
Since we have two groups and also sample sizes are very small we can use t significant value for finding out confidence interval
df = 5+5-2 =8
t critical value for 80% two tailed = 1.397
Conf interval 80%
=