An interesting brain teaser
The Pirate Loot Problem:
A neat brain teaser from Wikipedia:
Imagine you are the oldest in a band of five pirates, where no two pirates in the group are of the same age. It is your responsibility as the oldest pirate to decide how to divide the group's booty, which as per the pirate's game comprises one-hundred pieces of gold. Once you announce how you will allocate the gold, all the pirates in the group (including you) vote either "yes" or "no" on your decision. If at least half of the votes are "yes", the pirates divide the loot as you directed, after which everyone carries on about his business. But, if more than half of the votes are "no", you are then killed, and the task of deciding the allocation of gold lies with the next oldest pirate in the group.
Knowing that all the other pirates are just as smart, and just as logical as you, and furthermore, knowing that they all want the largest amount of gold they can get for themselves, how do you divide the gold so that you get the maximum amount of gold pieces possible, and guarantee that you will receive enough "yes" votes to stay alive?
Click here for the solution.
None of the pirates I know are that bright though.