number theory

classic Classic list List threaded Threaded
2 messages Options
Reply | Threaded
Open this post in threaded view
|

number theory

lucy
There is a pile of 18 matchsticks on a table. Players 1 and 2 take turns in removing matchsticks
from the pile, starting with player 1. On each turn, a player has to remove a number of sticks that
equals either 1, 2 or 3, such that the number of matchsticks that remain on the table equals some
non-negative integer. The player, who cannot do so, when it is his /her turn, loses. Which of the
following statements is true?
a) If player 2 plays appropriately, he/she can win regardless of how 1 actually plays.
b) If player 1 plays appropriately, he/she can win regardless of how 2 actually plays.
c) Both players have a chance to win, if they play correctly.
d) The outcome of the game cannot be predicted on the basis of the data given
Reply | Threaded
Open this post in threaded view
|

Re: number theory

Sris
just the internet for matchstick prob...u will get ur answer