5 pirates of different ages have a treasure of 100 gold coins.
On their ship, they decide to split the coins using this scheme:
The oldest pirate proposes how to share the coins, and ALL pirates (including the oldest) vote for or against it.
If 50% or more of the pirates vote for it, then the coins will be shared that way. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain.
As pirates tend to be a bloodthirsty bunch, if a pirate would get the same number of coins if he voted for or against a proposal, he will vote against so that the pirate who proposed the plan will be thrown overboard.
Assuming that all 5 pirates are intelligent, rational, greedy, and do not wish to die, (and are rather good at math for pirates) what will happen?
-
UP 0 DOWN 0 2 2
2 Answers
The oldest pirate will get 98 coins,the youngest and the third oldest will get 1 coin.
the oldest will get 98 coins. youngest and third oldest or fourth oldest will get one each..
the logic is:-
=>the 2nd oldest pirate will never vote in favour of the oldest, because if the oldest die, then he will get maximum.
=>the youngest will always vote because he can never expect to get more. because at max 2 pirates may remain and then d fourth oldest will take all.
=>the third oldest will vote with whatevr he gets because if the 2nd oldest decides, then he will not get any coins, as d 2nd oldest will take his own vote and tht of the youngest.