You are not logged in.
Pages: 1
Five pirates return from a mission of murder plunder on the high seas. They have 100 gold pieces that need to be divided amongst themselves.
The pirates, conveniently named A, B, C, D, and E have a seniority order. Even more conveniently, A is at the top of the list, followed by B, then C, D, and E.
The highest seniority pirate gets to propose how the gold is split, and then the whole group votes to approve of the split or not. The high seniority pirate gets 1.5 votes, and the other pirates get one vote. If the proposed split is approved, the gold is split up accordingly. If the proposed split is not approved, the high seniority pirate is killed by the other pirates, and the highest seniority of the remaining pirates get to propose the split, with the same rules.
All the pirates are rational.
How does Pirate A propose to split the 100 gold pieces to get the maximum amount for himself, while ensuring the proposal will be approved by vote?
You can shear a sheep many times but skin him only once.
Offline
30, 25, 25, 25, 20
Boy let me tell you what:
I bet you didn't know it, but I'm a fiddle player too.
And if you'd care to take a dare, I'll make a bet with you.
Offline
40, 30, 30, 0, 0
"The physicists defer only to mathematicians, and the mathematicians defer only to God ..." - Leon M. Lederman
Offline
Zach, MathIsFun, those answers are incorrect; please try again.
(I am interested in the logic you used to obtain those answers, though.)
The correct answer is rather non-intuitive.
You can shear a sheep many times but skin him only once.
Offline
40, 0, 0, 30, 30
Support MathsIsFun.com by clicking on the banners.
What music do I listen to? Clicky click
Offline
40, 0, 0, 30, 30
Please try again.
You can shear a sheep many times but skin him only once.
Offline
I could hide a hint or two if people wanted. The solution is VERY counter-intuitive. Had I not read the logic behind the solution, I never would have believed it.
You can shear a sheep many times but skin him only once.
Offline
99, 0, 1, 0, 0
Last edited by tt (2006-08-01 18:02:34)
Offline
99, 0, 1, 0, 0
Close. Very close. I think such a split would lose the vote.
You can shear a sheep many times but skin him only once.
Offline
The captain will take 98 coins, and will give one coin to the third most senior pirate and another coin to the most junior pirate.
If there were 2 pirates, pirate 2 being the most senior, he would just vote for himself and that would be 50% of the vote, so he's obviously going to keep all the money for himself. If there were 3 pirates, pirate 3 has to convince at least one other person to join in his plan. Pirate 3 would take 99 gold coins and give 1 coin to pirate 1. Pirate 1 knows if he does not vote for pirate 3, then he gets nothing, so obviously is going to vote for this plan. If there were 4 pirates, pirate 4 would give 1 coin to pirate 2, and pirate 2 knows if he does not vote for pirate 4, then he gets nothing, so obviously is going to vote for this plan.
As there are 5 pirates, pirates 1 and 3 had obviously better vote for the captain, or they face choosing nothing or risking a horrible death.
Offline
The captain will take 98 coins, and will give one coin to the third most senior pirate and another coin to the most junior pirate.
If there were 2 pirates, pirate 2 being the most senior, he would just vote for himself and that would be 50% of the vote, so he's obviously going to keep all the money for himself. If there were 3 pirates, pirate 3 has to convince at least one other person to join in his plan. Pirate 3 would take 99 gold coins and give 1 coin to pirate 1. Pirate 1 knows if he does not vote for pirate 3, then he gets nothing, so obviously is going to vote for this plan. If there were 4 pirates, pirate 4 would give 1 coin to pirate 2, and pirate 2 knows if he does not vote for pirate 4, then he gets nothing, so obviously is going to vote for this plan.
As there are 5 pirates, pirates 1 and 3 had obviously better vote for the captain, or they face choosing nothing or risking a horrible death.
Correct answer and logic. excellent
You can shear a sheep many times but skin him only once.
Offline
98, 0, 1, 0, 1
Well, too late to correct my silly mistake! Devante got it right.
Last edited by tt (2006-08-02 07:11:49)
Offline
has anyone else notices the solution to this puzzle on the main
website is flawed?
Offline
I didn't even know this puzzle was on the main website.
Could you link it here?
Why did the vector cross the road?
It wanted to be normal.
Offline
Well, it is : www.mathsisfun.com/puzzles/5-pirates.html
"There is not a difference between an in-law and an outlaw, except maybe that an outlaw is wanted"
Nisi Quam Primum, Nequequam
Offline
Pages: 1