English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

I had some hacker penpal about 10 years ago, he asked me to "translate the following bit code", I never was able to solve it and have kept it since.

Can anyone solve it, or maybe give me clues on how I can solve it? I'm stumped with it. Converting binary to base 26 does not translate into any letters.

1101 100 00 010 001 100000 100 000 010000000 0000 000 0000000 000 111

2006-10-21 00:35:40 · 4 answers · asked by Anonymous in Science & Mathematics Mathematics

thanks for putting an effort in, but can you add the logic you used to how you're getting these answers?

2006-10-21 02:21:39 · update #1

Might I add, there are spaces in between these digits, creating groups that may correspond to letters. But not entirely sure. This is a riddle and not necessarily a binary to Unicode conversion.

2006-10-21 02:23:57 · update #2

Thanks for answering my question, can you post a comment of what translator you are using .

Also, I don't think this is necessarily a translation, but it's more of a riddle to solve, however I'd like to understand the translation because perhaps this will open another facet of this riddle to me. Thanks,

2006-10-21 02:27:25 · update #3

I found a translator these guys are using, however removing spaces from these strings of 0's and 1's yeilds the same answer. The spaces are important.

http://www.adcott.net/binary/

Any other ideas???

2006-10-21 03:11:13 · update #4

4 answers

This is what one binary translator gave me:

Ø#

Here's what another translator gave me:

Ø#

Here's what a third translator gave me:

Ø#

Here's what a fifth translator gave me:

Ø#

Is it a coincidence that five completely different binary translators gave the same message? I don't think so!

2006-10-21 02:14:57 · answer #1 · answered by عبد الله (ドラゴン) 5 · 0 0

all of them have the comparable hat on. the adult adult males on the top are on the main turn away. the guy no longer dealing with all of us's back could desire to bypass final. If the final guy solutions first he can see what coloration the guy in front of him in donning and has a 50/50 hazard of surviving if he's the single with a diverse hat. while the 8 different adult adult males have replied the final guy can see the 1st adult adult males hat and rule out all of us having a diverse colored hat. the guy in front who has no person's back dealing with him has a 50/50 hazard yet while he's been listening and doesnt enable his nerves get the extra beneficial of him he will answer the comparable as all of us else. all of us is going unfastened.

2016-12-08 18:26:24 · answer #2 · answered by slagle 4 · 0 0

I made a program to convert it
it translates to

Ø#

2006-10-21 02:17:50 · answer #3 · answered by ? 5 · 0 0

αγθ ΰμξ κβ ώϋχ τπρβίε φωα ψ'αγθ ΰμξκβ ώϋχ τπρβίε φω αψ

Interesting!!!!!....lol

2006-10-21 00:46:48 · answer #4 · answered by c00kies 5 · 0 0

fedest.com, questions and answers