[superprismatic]

The Fabulous Gazeeka Box converts

letters into their binary equivalents

(A=00001, B=00010, etc.), scrambles

these 5-bit groups -- always in the

same way -- and outputs the results

as reconstituted letters. A certain

word fed into the F.G.B. comes out

NYVRTBKPIJ. Can you unscramble this?

[Guest]

is the second to last letter capital i I or lowercase L l? I assume its uppercase since all the other letters are but just wanna make sure before i try

[bonanova]

NYVRTBKPIJ.

Can you unscramble this?

35214 [keeping the plain text hidden for other solvers].

More?

final: all caps.

[bushindo]

Can you unscramble this?

Nice puzzle. I had a good laugh when I saw the plain text.

LEBRUMSCAN, keeping the plaintext scrambled for other solvers

Edited August 9, 2009 by bushindo

[superprismatic]

is the second to last letter capital i I or lowercase L l? I assume its uppercase since all the other letters are but just wanna make sure before i try

Upper case i.

[Guest]

so at first when i read this i thought you said/meant bitwise operations. And well I found out (or my program did) that and,or,not,xor all dont work if anyone cared. but im thinking now (as i reread it) you mean that the numbers are just ordered differently in a consistent way. anyway whether i messed up or misread it im done thinking about it for right now maybe later.

[Guest]

so that way was a little easier to program and Im so dense bonanvas response sailed right over my head when i first read the problem and once i figured out what i was really suppose to do I didnt reread it. I still am a little lost on bushindo's response but I can never fully understand what he says anyway. Is there a way to do this other then the program or brute force method. I know there's some quick eliminations you can do, but other then that the brute force method would have taken a while.

uzmlidvhrt (it's German)

[bushindo]

so that way was a little easier to program and Im so dense bonanvas response sailed right over my head when i first read the problem and once i figured out what i was really suppose to do I didnt reread it. I still am a little lost on bushindo's response but I can never fully understand what he says anyway. Is there a way to do this other then the program or brute force method. I know there's some quick eliminations you can do, but other then that the brute force method would have taken a while.

uzmlidvhrt (it's German)

I don't know german, but I'm pretty sure that solution looks more like Klingon than german.

I think you used the following scrambling transformation for the above solution

(a, b, c, d, e) --> ( c, a, b, e, d)

If you brute forced this then you probably missed that 1 english word that is technically the 'true' solution among the 120 possible words. The answer i posted earlier is the plain text english word, but with the letters scrambled up.

Edited August 9, 2009 by bushindo

[Guest]

oh no i was just kidding i got the answer, I used a program to out put all possible answers and found it among the giberrish ones

[bushindo]

oh no i was just kidding i got the answer, I used a program to out put all possible answers and found it among the giberrish ones

Ah, i see. You got me there. I also examined this with a brute force method, although there were only 120 options, which are not too bad. If someone found the solution by hand with some ingenious elimination method, I'd like to hear about it.

[Guest]

yah well i started by hand and i eliminated anything that would make any one start with 111-- definitely and 11--- probably but after writing a couple of the still viable answers down i decided to write the program. The magic of computers.

[bonanova]

Permuting the binary encoding preserves the number of 1's.

Letters therefore only permute within their class [same number of 1's].

1 {A B D H P}

2 {C E F I J L Q R T X}

3 {G K M N S U V Y Z} and

4 {O W}.