You are not logged in.
Pages: 1
Thanks for all the input guys and gals!
I didn't realise that you could leave 'extra' bananas along the way for a future trip, but there's nothing in the wording of the question that forbids it. However, I did forget to mention that the bananas are integers, e.g. you cannot travel 333 1/3 km and deposit 333 1/3 bananas. Someone on another forum tried this, but still couldn't better 533.
As for the interview, I was trying to get a actuarial internship with Deloitte.
By the way, George Y, if you have proved that 533 is the maximum, could you please try to translate it or give me the URL to that page.
I have tried MathsIsFun's suggestion of working backwards, but there are still too many possibilities. Thanks again for all your contributions, but if there is anyone from the Deloitte recruitment dept out there, please share the answer!
Well I would definitely agree with assumption one, because the furthest he could go in one journey is to the market. However, he would have left back 2000 bananas, and he would arrive with nothing.
It would also seem logical to assume the second, though I am not completely sure. Has anyone had any success with this?
Hi I got this question in an interview, and I'm just dying to know how to do it, because I only had 10 mins to complete it!! My best answer is 533, but the most is 567. Please show me how.
Problem:
A man has a camel with a carrying capacity of up to 1000 bananas. He has to cross 1000km of desert to get to the market to sell his bananas. He starts with 3000 bananas. For each km the camel travels, it requires 1 banana. What is the most he can sell?
My working:
He carries 1000 bananas for 200km and deposits 600. He goes back and does the same. He goes back again and does the same again, but now he has no bananas left at the start, and 2000 at 200km. Next he carries 1000 for 333km and deposits 333 at 533 km. Does this again until 0 at 200km and 1000 at 533km. Then he carries 1000 bananas for 467km to market, which leaves 533 bananas to sell.
Please try to improve on this and get 567 if you can.
Thanks in advance.
Pages: 1