Oooh, I dropped a factor of 2 in the second one and didn't notice because it takes longer than you'd expect before the numbers start increasing. Revised answer:
dhrfgvba gjb
Vs lbh qb gur nflzcgbgvpf pbeerpgyl engure guna jebatyl, gur ibyhzr tbrf hc yvxr (cv gvzrf r bire rvtug) gb gur cbjre a/2 qvivqrq ol gur fdhner ebbg bs a. Gur "zvahf bar" va gur sbezhyn sbe gur enqvhf zrnaf gung gur nflzcgbgvp tebjgu gnxrf ybatre gb znavsrfg guna lbh zvtug rkcrpg. Gur nafjre gb gur dhrfgvba gheaf bhg gb or bar gubhfnaq gjb uhaqerq naq fvk, naq V qb abg oryvrir gurer vf nal srnfvoyr jnl gb trg vg bgure guna npghny pnyphyngvba.
Correct.
I gave some Haskell code as a comment over there on my blog, under the posted problem.
1206 dimension is the smallest number. One can experiment with other values.
If it's worth saying, but not worth its own post, then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should start on Monday, and end on Sunday.
4. Unflag the two options "Notify me of new top level comments on this article" and "