Re: Anyone want to work for Google?
From: John Ramsden (john_ramsden_at_sagitta-ps.com)
Date: 07/12/04
- Next message: Michael N. Christoff: "Re: Minimal Triangulation for Simplicial Complex"
- Previous message: Jim Ferry: "Re: JSH: Groupthink"
- In reply to: Van Jacques: "Re: Anyone want to work for Google?"
- Next in thread: Tim: "Re: Anyone want to work for Google?"
- Messages sorted by: [ date ] [ thread ]
Date: 12 Jul 2004 09:59:16 -0700
"Van Jacques" <calccurve-test23@yahoo.com> wrote in message news:<cctq8u$dso@odbk17.prod.google.com>...
>
> [...]
>
> From the above URL:
>
> Upon making it to the second level of questioning, that is if you are
> able to, you are hit up with this question as seen on 7427466391.com:
>
> f(1)= 7182818284
> f(2)= 8182845904
> f(3)= 8747135266
> f(4)= 7427466391
> f(5)= __________
>
> The solution to the equation is a password for you to continue on for
> the third level.
Possible spoiler:
As all the numbers are the same length I assumed it was a bit-map,
like in that film Contact (?), so one has to write out all the 0s
and 1s and then from the resulting image infer the final line.
But I haven't tried that.
(As 9s are present, and none of the digits exceeds 9, the numbers
are presumably decimal.)
Cheers
John Ramsden (john_ramsden@sagitta-ps.cam) <-- com not cam
- Next message: Michael N. Christoff: "Re: Minimal Triangulation for Simplicial Complex"
- Previous message: Jim Ferry: "Re: JSH: Groupthink"
- In reply to: Van Jacques: "Re: Anyone want to work for Google?"
- Next in thread: Tim: "Re: Anyone want to work for Google?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|