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
Required
The dimension that minimizes the cost
The volume is:
This gives:
Substitute
Make H the subject
The surface area is:
Area = Area of Bottom + Area of Sides
So, we have:
The cost is:
Substitute: and
To minimize the cost, we differentiate
Then set to 0
Rewrite as:
Divide both sides by W
Rewrite as:
Solve for
Take cube roots
Recall that:
Hence, the dimension that minimizes the cost is:
Answer:
Thats the answer
Step-by-step explanation:
