You must be logged in to see worked solutions.

Already have an account? Log in here.

Is it possible to repeatedly **flip over pairs of adjacent coins** so that all 3 coins are gold side up?

All coins have one gold side and one silver side.

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

Each of the arrangements of three coins which we were able to flip into all gold coins had an odd number of gold coins (1 or 3). Like most patterns in problem solving, this is no coincidence.

Each flip of adjacent coins does one of the following:

- increases the number of gold coins by 2 (if both coins were silver)
- decreases the number of gold coins by 2 (if both coins were gold)
- leaves the number of gold coins unchanged (if one was silver and one was gold)

**In every case, the parity (even or odd) of the number of gold coins does not change.** For all three coins to be gold, it is necessary that the original number of gold coins be odd as well.

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

We built up from small cases to discover an interesting property of the coin flipping problem. Specifically, it is necessary that the parity of the initial number of gold coins be the same as the parity of the total number of gold coins in order to be able to make all of the coins gold.

It turns out that this condition is **sufficient**. For example, if there is an even number of coins and you start with any even number of gold coins, it is always possible to make all of the coins gold. Later in this Exploration, we'll explore an algorithm for doing so.

×

Problem Loading...

Note Loading...

Set Loading...