The numbers are written on a blackboard. Andrew and Bob take turns, and Andrew goes first. On each turn, one of Andrew or Bob chooses two numbers and on the board, erases them and writes . They do this until only one number is left on the board. Andrew wins if the number is odd, Bob wins if the number is even, and it is a draw if the number is not an integer.
Assuming Andrew and Bob play optimally, which player will win, or will it be a draw?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Define x ⋄ y = x + y + x y . Then x ⋄ ( y ⋄ z ) ( x ⋄ y ) ⋄ z = x ⋄ ( y + z + y z ) = x + ( y + z + y z ) + x ( y + z + y z ) = x + y + z + x y + x z + y z + x y z = ( x + y + x y ) ⋄ z = ( x + y + x y ) + z + ( x + y + x y ) z = x + y + z + x y + x z + y z + x y z x ⋄ y = x + y + x y = y + x + y x = y ⋄ x so that ⋄ is both associative and commutative. Therefore, the final number is independent is any strategies the two players use .
Therefore, we may choose the order to play the game.
and so on, the pattern continuing as
until
In summary, the final number will always be 2 0 1 7 , which is odd, so Andrew wins .