### Home > INT3 > Chapter 6 > Lesson 6.3.1 > Problem6-73

6-73.

A NEVER-ENDING GAME?

Jack and Jill are playing a game in which Jack has two pennies and Jill has four pennies. A coin is tossed. If it lands on heads Jill has to give a penny to Jack. If it lands on tails, Jack gives a penny to Jill. The game is won when one of them has all of the pennies. They think that they can keep playing all day since the coin has an equal chance of landing on heads or tails, so they will just keep passing coins back and forth.

Simulate the coin tosses on your calculator and keep track of the pennies with pencil and paper. Can they keep playing all day, or does one player have a better chance of winning the game?

Let $0=$ heads and $1=$ tails.
Use a random number generator to generate $0$s and $1$s.
On your graphing calculator this is randInt$(0,1,1)$.

Use the eTool below to simulate the problem by clicking the coin below.
Click the link at right for the full eTool version: INT3 6-73 HW eTool.