[Request] xkcd 953 optimal response
I was reading xkcd and saw this comic: [https://xkcd.com/953/](https://xkcd.com/953/), and wondered if there was an optimal string of digits for a response, with the following criteria:
1. It has to only contain the digits 0 and 1, lest it be unreadable in binary. 2. If x is the string of digits, xβ β 1 + (xββ β 1) Γ· 9 = 1. In other words, interpretation on a binary scale balances interpretation on a decimal scale, so that the binary chance if true plus the decimal chance if true add up to 100%.
\~\~For the optimal case as in best probability of a correct answer, you could say 1.1111β¦ repeating, but 1.1β¦β \[1ββ10β\] + 1.1β¦ββ \[1βββ10ββ\] > 100%.\~\~ Best chance of correct answer is not what Iβm worried about.
If there are multiple solutions, please give me all of them or the one with the biggest difference between xβ β 1 and (xββ β 1) Γ· 9. And if there are none, I would love to know why (and if any exist in the general case).
\[Edit: It doesnβt have to be a whole number. In fact, it probably wonβt be. It should start with 1.1111110, as the decimal interpertation could never exceed 1β81 correct using only 1βs and 0βs (except 10, which we can rule out because then the chances add to 200%) and thus the binary must exceed 80β81, and it also cannot have 1 as the next digit, because then it would force the binary too large for the decimal. Hold on, the decimal has enough data to extrapolate the binary, thus giving the decimal more dataβ¦ I might be onto something.\]
EDIT: I solved it: 1.11111100110101101110101000010100111001 are the first few digits.