Talk:Two identical strings

task title

This (draft) task needs a better name,   perhaps:

       Decimal numbers whose binary version can be expressed as a concatenation of two identical binary literals.

Wordy and a bit verbose,   but more accurate.     -- Gerard Schildberger (talk) 10:04, 3 April 2021 (UTC)

task clarification

Obviously, 10 bits goes to 1024, and that's just over the limit of 1000. In the examples so far, "half" binary string literals are 1 to 5 digits long, each starting with one:

1
10, 11
100, 110, 101, 111
etc...

Doubling to:

11
1010, 1111
100100, 110110, 101101, 111111
etc...

Will it be permitted to do leading zeros on the "half" binary literals? Such as:

001, 010, 011, etc...
0001, 0010, 0011, etc...
00001, 00010, 00011, etc...

Doubling to:

001001, 010010, 011011, etc...
00010001, 00100010, 00110011, etc...
0000100001, 0001000010, 0001100011, etc...

And of course, are palindromes permitted?

example: 1001111001, 1100110011, etc..., and the like.

The two "halves" are still identical, just reversed.--Enter your username (talk) 10:55, 3 April 2021 (UTC)