12 cm 3 cm 3 cm 3.14
2 answers:
You might be interested in
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