Re: Anyone want to work for Google?
From: Phil Carmody (thefatphil_demunged_at_yahoo.co.uk)
Date: 07/12/04
- Next message: David Kastrup: "Re: Anyone want to work for Google?"
- Previous message: Phil Carmody: "Re: Anyone want to work for Google?"
- In reply to: Van Jacques: "Re: Anyone want to work for Google?"
- Next in thread: Teabag: "Re: Anyone want to work for Google?"
- Reply: Teabag: "Re: Anyone want to work for Google?"
- Messages sorted by: [ date ] [ thread ]
Date: 12 Jul 2004 16:55:39 +0300
"Van Jacques" <calccurve-test23@yahoo.com> writes:
> Van Jacques wrote:
> > Richard Tobin wrote:
> > > In article <cctq8u$dso@odbk17.prod.google.com>,
> > > Van Jacques <calccurve-test23@yahoo.com> wrote:
> > > >f(1)= 7182818284
> > > >f(2)= 8182845904
> > > >f(3)= 8747135266
> > > >f(4)= 7427466391
> > > >f(5)= __________
> > >
>
> I don't see how to find out where to start in the sequence though.
> I thought maybe n^^3 - n - 1 would help, but it only works for
> n = 2 and 3.
Hint -
A 7-year-old with a decimal expansion of e could probably work
this out more quickly than a 17-year-old. Don't look for
something "clever".
Phil
-- 1st bug in MS win2k source code found after 20 minutes: scanline.cpp 2nd and 3rd bug found after 10 more minutes: gethost.c Both non-exploitable. (The 2nd/3rd ones might be, depending on the CRTL)
- Next message: David Kastrup: "Re: Anyone want to work for Google?"
- Previous message: Phil Carmody: "Re: Anyone want to work for Google?"
- In reply to: Van Jacques: "Re: Anyone want to work for Google?"
- Next in thread: Teabag: "Re: Anyone want to work for Google?"
- Reply: Teabag: "Re: Anyone want to work for Google?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|