Brainy Puzzles
Puzzle Solvers: Interesting brainy puzzles shared by fellow puzzlers
359 Members
Join this group to post and comment.

# The big big elephant puzzle.

There are two cities A and B 1000 km apart. An elephant is having 3000 bananas with him which he has to carry from city A to B. He can carry maximum of only 1000 bananas at a time and eats 1 banana after he travels 1km distance. find the maximum number of bananas that he finally caries to the destination (city B).
lovejeet • Apr 3, 2011
400 bananas approx.??????
Varsha0802 • Apr 3, 2011
OK now that's funny! Suppose he starts with 1000 bananas, and eats one banana after every one km. when reached 1000 kms, he is left with none. How will he come back to take other 2000 bananas (coz he is left with no more bananas)?

PS: If it sounds too silly, ignore it.
vipandeep • Apr 3, 2011
1000 Bananas in his stomach
Varsha0802 • Apr 3, 2011
But how will he be able to carry all the bananas?
Farjand • Apr 3, 2011
If the elephant carries 1000 bananas at a time, how can he take remaining 2000 bananas with him?
lovejeet • Apr 3, 2011
@farjand, varsha0802- please apply a bit of your brains.............. there is nothing wrong with the question.....
it's not specified that the elephant travels 1000 km at once........
let he travels only 400 kms, drops 200 banana's there, comes back with remaining 400 bananas, repeats the procedure.......
and at last reaches the destination with 400 bananas............. correct me if i m wrong......
Varsha0802 • Apr 3, 2011
Oh ok I got it now. I thought he has to travel whole distance at once. 400 is the correct answer. And ya, I never said there was anything wrong with the question.
sorry friends... 400 is not correct. 😔
I think you will have to work out a little more...
hint- answer is greater than 400.
sushant ghatage • Apr 7, 2011
There are two cities A and B 1000 km apart. An elephant is having 3000 bananas with him which he has to carry from city A to B. He can carry maximum of only 1000 bananas at a time and eats 1 banana after he travels 1km distance. find the maximum number of bananas that he finally caries to the destination (city B).