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.
Answer:
Step-by-step explanation:
Answer:
D
Step-by-step explanation:
To subtract fractions, we need an lcd( lowest common denominator)
8. the lcd is 42 because it’s the smallest number that 6 and 7 are both factors of. the lcd is the bottom of the fraction
to make the denominator of (4/7) 42, we will multiply the top and bottom by 6 and we get (24/42)
to make the denominator of (3/6) 42, we will multiply the top and bottom by 7 and we get (21/42)
these two numbers now have the same denominator so we subtract them
24/42 - 21/42 = 3/42 which simplifies to 1/14
9. since these fractions already have a common denominator, we will make them mixed fractions
-5(2/7) as a mixed fraction. first multiply 5*7 which is 35. now add 2 which is 37. our mixed fraction is -37/7
-1(5/7) as a mixed fraction. multiple 1*7 which is 7. now add 5 which is 12. our mixed fraction is -12/7
now subtract (-37/7) - (12/7) and we get -49/7 which simplifies to -7
Answer:
2? The last one
Step-by-step explanation: