🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: uk.education.maths
Article #13

Re: GOING BANANAS OVER THIS PROBLEM

#13
From: Bill Hayes
Date: Sat, 26 Feb 2000 00:00
54 lines
3471 bytes
444

The merchant has to make 3 runs, the first with no supplies along the way as
he had only take 1000 bananas, hence his max range is 500, considering the
return.  But if he went 500 Km he could not leave any bananas for his next
trip so the most efficient number to leave is the number of KM at that
point.  Hence the number to drop is 334 at 333kms.  The next trip he has a
max range of 1000 + 334 Kms.  This means at 444 km he can drop 444 bananas.
He can then return to 333 Km to replenish to make it back to base.  The last
trip with his remaining 1000 bananas he uses till 444km by  which time he
has eaten 444 bananas, and thus, has room for his 444 he dumped on the
previous trip. Thus he has 444 over at the end of the trip.
He also may have 2 in his pocket, as none of the divisions worked nicely.
What's the address of the French news group, I'd like to see if they worked
out the odd number of bananas or not?

Sophus Lefouque (M) <vng@ERASE.letterbox.com> wrote in message
news:38A44F1C.6A3E9008@ERASE.letterbox.com...
> i got this from the French Maths newsgroup.
> ==================================================================
> A banana merchant has 3000 bananas to sell.  He has to render
> himself at the market situated 1000 km away with his elephant,
> which cannnot transport more than 1000 bananas on each trip.
> The elephant eats 1 banana per km, how many bananas can the
> merchant sell?
> PS: The answer is not zero.
> ==================================================================
>
> i'll let you guys have a go at it.
>
> [i know, there is plenty of room for humorous remarks on this one.
> and please don't "cheat" by going over to the French newsgroup to
> peep at the answer.]
>
> :-)
>
>
>
>
> ==================================================================
> ==================================================================
> ==================================================================
> JOCELYNE DORVILLE wrote:
> >
> > Un marchand de bananes � 3000 bananes � vendre. Il doit se rendre au
march�
> > qui se trouve � 1000 kms avec son �l�phant qui ne peut transporter que
1000
> > bananes � chaque voyage. L'�l�phant mange 1 banane par km, combien le
> > marchand peut-il vendre de bananes ?
> > PS : La r�ponse n'est pas 0.
> > C�lia.
> ==================================================================
>
Technical Details
Message-ID: <951540994.327689@foxlink2.foxall.com.au>
Path: arc1-ca.pugleaf.net!unknown!not-for-mail
References: <38A44F1C.6A3E9008@ERASE.letterbox.com>

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: f458d,9e8d3dd20468136f
X-Google-Attributes: gidf458d,public
X-Google-Thread: f7f17,9e8d3dd20468136f
X-Google-Attributes: gidf7f17,public
X-Google-Thread: 10d67e,9e8d3dd20468136f
X-Google-Attributes: gid10d67e,public
From: "Bill Hayes" <blaze001@foxall.com.au>
Subject: Re: GOING BANANAS OVER THIS PROBLEM
Date: 2000/02/26
Message-ID: <951540994.327689@foxlink2.foxall.com.au>
X-Deja-AN: 590150015
Cache-Post-Path: foxlink2.foxall.com.au!unknown@203.43.115.30
References: <38A44F1C.6A3E9008@ERASE.letterbox.com>
X-Priority: 3
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2014.211
X-Complaints-To: abuse@telstra.net
X-Trace: vic.nntp.telstra.net 951540883 203.36.181.194 (Sat, 26 Feb 2000 15:54:43 EST)
Organization: Ye 'Ol Disorganized NNTPCache groupie
X-MSMail-Priority: Normal
X-Cache: nntpcache 2.3.3 (see http://www.nntpcache.org/)
NNTP-Posting-Date: Sat, 26 Feb 2000 15:54:43 EST
Newsgroups: uk.education.maths,aus.mathematics,soc.culture.singapore