Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: 2, 2, 2, 3, 7, 22, 83, ...

by bobf (Monsignor)
on Feb 06, 2006 at 07:55 UTC ( #528167=note: print w/ replies, xml ) Need Help??


in reply to 2, 2, 2, 3, 7, 22, 83, ...

How appropriate. ;-)

Hint and spoiler:

The series in question is described by the following problem:

Given an unlimited supply of bananas, how far can a camel walk into the desert if it can carry only one banana at a time and if it eats one banana per mile?


Comment on Re: 2, 2, 2, 3, 7, 22, 83, ...
Re^2: 2, 2, 2, 3, 7, 22, 83, ...
by jbrugger (Parson) on Feb 06, 2006 at 13:45 UTC
    Wow, now that you spoiled me, (and i guessed wrong of course) i admit i never saw this coming!
    Thanks for the enlightment, and making me feel a complete idiot :)

    "We all agree on the necessity of compromise. We just can't agree on when it's necessary to compromise." - Larry Wall.
Re^2: 2, 2, 2, 3, 7, 22, 83, ...
by davido (Archbishop) on Feb 06, 2006 at 16:53 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://528167]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (6)
As of 2014-08-21 10:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (134 votes), past polls