A discrete mathematics problem by Áron Bán-Szabó

Sharky and Ivan are playing a strange game, with Sharky going first.

They start with two heaps: a left and a right heap. The left heap contains 6, the right heap contains 4 coins. They then take turns to remove some of the coins using the two rules below.

You may either

  1. remove one coin from both of the heaps.

  2. remove exactly one coin from one of the heaps.

If a person makes the last move, then lose. Who has the winning strategy?


Problem Loading...

Note Loading...

Set Loading...