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

 A Pack of Prudent Pirates (Posted on 2002-08-19)
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)

 Subject Author Date reverse logic Axorion 2007-11-20 03:58:40 How I'd solve it Michael Rudolph 2007-05-10 17:25:20 Fascinating Puzzle, and it has problems. Tonio Loewald 2005-09-09 01:16:38 re: I beg to differ Popstar Dave 2003-10-30 07:20:24 re: I beg to differ DJ 2003-05-01 09:39:52 re: I beg to differ Jon 2003-04-30 08:37:35 I beg to differ pleasance 2002-12-05 06:31:17 the real solution crazy-kook 2002-09-06 16:35:46 re(4): Applied Psychology friedlinguini 2002-08-20 05:07:55 re(3): Applied Psychology Jim Lyon 2002-08-19 17:35:43 re(2): Applied Psychology levik 2002-08-19 11:38:34 re: Applied Psychology friedlinguini 2002-08-19 10:46:52 Applied Psychology Jim Lyon 2002-08-19 10:06:13 re: dont understand.. friedlinguini 2002-08-19 05:36:08 dont understand.. Cheradenine 2002-08-19 05:27:04 Solution friedlinguini 2002-08-19 03:45:12 try this.. Cheradenine 2002-08-19 03:34:42

 Search: Search body:
Forums (0)