---

Problem 7 (Bonnie and Clyde)

Two bandits, Bonnie and Clyde, divide a chest of gold coins between them as follows: one for Bonnie, two for Clyde, three for Bonnie, four for Clyde, and so on until they run out of coins. If they get to "20" for Clyde but there are less than 20 coins left in the chest, the game stops and Clyde gets the remaining coins. Likewise for Bonnie, if she is the last player, she gets the remaining coins. Who is better off, Bonnie or Clyde ?

[Previous]	Problem 6 (Interesting Equation)
[Next]	Problem 8 (Trapezoid Problem)
[Up]	November Problems
[Home]	Home Page
[Mail]	Send EMail to Maine Math Talent Search
[Contents]	Maine Math Talent Search Contents

Last modified on Tuesday, January 12, 1999