There are five robbers. They steal 1000 gold coins and want to divide the coins among them: But there is caveat: The youngest robber has to present a plan to divide the coins. The plan is accepted only if majority of robbers accept it. (Two out of four won't do.)
If the plan is rejected the presenter of plan is shot and the next older robber gets a chance.
So do you think the youngest robber can save his life and get any coins? Or whats the proportion of gold coins each robber get after partition?
Note: Each robber is very intelligent.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment