All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
A Pack of Prudent Pirates (Posted on 2002-08-19) Difficulty: 3 of 5
After a long season of plunder, a pirate team of five Prudent Pirates has amassed a booty of 500 golden coins. Before they part their ways, the five decide to divide the treasure.

They that they will each propose a division strategy in order of their seniority: first the oldest pirate will propose the strategy for the division of coins. All five will then vote on it, and if at least half vote "Yes", the strategy will be used to divide the coins. If the majority rejects the plan however, the oldest pirate will be killed, and the whole process will be repeated with the remaining pirates, with the second oldest proposing his strategy.

Since all the pirates are very prudent, each one will want to claim as many coins for himself without getting killed. Given this, how many coins will each of the pirates (5 - 1, with 5 being the oldest) get, and why? What strategy will the oldest pirate propose?

See The Solution Submitted by levik    
Rating: 4.3750 (16 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
dont understand.. | Comment 3 of 17 |
(In reply to Solution by friedlinguini)

"To ensure a 2-2 vote, B must make at least one of C, D, or E happier than in the previous case. In this case, either giving D or E an extra coin will make them happy, so a division of 498-0-0-2 or 498-0-1-1 will work."

what about 499-0-1-0?
  Posted by Cheradenine on 2002-08-19 05:27:04

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information