On Nov 16, 2007, at 7:20 PM, Eric I. wrote:

>> The encoding works by taking each successive character of a  
>> message and raising
>> each successive prime to some function of that character, and  
>> multiplying these
>> powers of primes together. So for example we could use the ASCII  
>> code + 1 to
>> allow for nulls to be encoded. Then "Ruby\r\n" would end up as:
>>
>>         (2 ** R) * (3 ** u) * (5 ** b)....
>>
>>          
>> 10992805522291106558517740012022207329045811217010725353610920778
>>          
>> 28664749233402453985379760678149866991742205982820039955872246774
>>          
>> 86029159248495553882158351479922840433375701904296875000000000000
>>          
>> 00000000000000000000000000000000000000000000000000000000000000000
>>         000000
>
> If I'm not mistaken, the number given is the encoding for "Ruby\n".

Yeah, I think you are right.  I've updated the quiz page.

James Edward Gray II