Take One or Two December 2, 2015 Consider the following game. The board consists of n tokens. At each turn, a player must take either 1 or 2 tokens off the board (which are discarded). The player who takes the last token - Combinatorial proof - Document - PDFSEARCH.IO

First Page	Meta Content
	Take One or Two December 2, 2015 Consider the following game. The board consists of n tokens. At each turn, a player must take either 1 or 2 tokens off the board (which are discarded). The player who takes the last token Add to Reading List Document Date: 2015-12-04 19:21:56 Open Document File Size: 88,82 KB Share Result on Facebook

Take One or Two December 2, 2015 Consider the following game. The board consists of n tokens. At each turn, a player must take either 1 or 2 tokens off the board (which are discarded). The player who takes the last tokenAdd to Reading List