User:Canter
From Wikipedia, the free encyclopedia
I am mainly interested in helping to write and improve articles on mathematics.
[edit] Amusing Problem
There are ten pirates, who have recently acquired a sack of gold coins, 100 in all. They have a strict hierarchy, in which the leader, number 1, outranks number 2, who outranks number 3 and so on. The leader will propose a division of the coins, on which all the pirates vote. If the leader gets half or more of the votes then his motion is carried, and the coins are so divided. Otherwise he is made to walk the plank, and number 2 takes over, with the same responsibility to propose an acceptable division of the coins. Assuming that the pirates are greedy capable mathematicians, what happens? (Note that the leader gets one vote himself, which he will presumably use to vote for whatever he proposes.)
