Home

Silly puzzles

Mon, 07/05/2007 - 00:07 — tony

So in an attempt to confuse what little mind was left of rob on IRC after a long day, I threw a bizarre puzzle his way, and to my surprise, he actually worked it out. This is how it went:

< tonyyarusso> rob: 'k, now convert "hello world" to binary, then to a base ten number, divide by your age, subtract your street address, multiply by the number of cousins you have, convert back to text via ascii character codes, and give us the result. Oh, and you have to do it on paper - we want scans.

(A few minutes later...)

< rob> tonyyarusso, the answer to your question is:


Bookmark/Search this post with:

Comments

Mon, 07/05/2007 - 04:32 — dtlin (not verified)

By the way, I win for not

By the way, I win for not truncating to [-2^31,2^31) when converting to decimal. :P
2. Looks like a fish to me.
3. Take "hello world" , treat its ASCII as a big-endian base-256 number, sort its unique prime factors, convert each factor into a little-endian base-36 number, and convert it to a string using '0'..'9','a'..'z'; i.e.,
let n = foldl ((+) . (*) 256) 0 . map ord $ "hello world"; m (x:l) = x:m (filter ((/= 0) . (`mod` x)) l) in filter ((== 0) . (mod n)) (takeWhile (>= unfoldr (\x -> if x == 0 then Nothing else Just (x `mod` 36, x `div` 36)) >>= return . (!!) (['0'..'9']++['a'..])
but better.

Mon, 07/05/2007 - 03:52 — dtlin (not verified)

$ ghci Prelude> :m Data.List

$ ghci
Prelude> :m Data.List Data.Char Data.Bits
Prelude Data.Bits Data.Char Data.List> "hello world"
"hello world"
Prelude Data.Bits Data.Char Data.List> it >>= zipWith ($) (map (((("01" !!) . fromEnum) .) . flip testBit) $ reverse [0..7]) . repeat . ord
"0110100001100101011011000110110001101111001000000111011101101111011100100110110001100100"
Prelude Data.Bits Data.Char Data.List> read it :: Integer
110100001100101011011000110110001101111001000000111011101101111011100100110110001100100
Prelude Data.Bits Data.Char Data.List> it `div` 21
5242857195242905286238100481428623862428619047624333861957195762433338100481428623814
Prelude Data.Bits Data.Char Data.List> it - 181
5242857195242905286238100481428623862428619047624333861957195762433338100481428623633
Prelude Data.Bits Data.Char Data.List> it * 5
26214285976214526431190502407143119312143095238121669309785978812166690502407143118165
Prelude Data.Bits Data.Char Data.List> reverse $ unfoldr (\x -> if x == 0 then Nothing else Just (chr $ x `mod` 256, x `div` 256)) it
"N\169UU"

Mon, 07/05/2007 - 02:18 — Here we are now, entertain us (not verified)

[...] You sucked me in. [...]

[...] You sucked me in. [...]

Mon, 07/05/2007 - 01:21 — Ian McEwen (not verified)

So I didn't do it on paper,

So I didn't do it on paper, but I *was* bored enough to use web converters and such for it (probably did it wrong anyway :P):

1. $w

2. Trails from some sort of odd flying craft? Maybe?

3. Maybe later...