solutions_hw1

solutions_hw1 - Solutions to homework 1 1.5#1 Mis`re...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions to homework 1 1.5#1 Mis` ere version of the take-away game. There are 21 chips, we can remove 1, 2, or 3. Last player to move loses, hence position 1 is a P-position, from positions 2,3, and 4 we can move to 1, hence these are N-positions. Now, 5 is a P-position again, since we can only move to N-positions from it, and so on. .. We can guess the pattern by the first couple sample points: if x 1 mod 4 then it is P-position, else an N-position. We can prove this by showing that (i) the terminal position is an N-position (mis` ere); (ii) If we make a move from a P-position ( x 1 mod 4), then x - 1 6≡ 1 mod 4, x - 2 6≡ 1 mod 4, nor x - 3 6≡ 1 mod 4; (iii) Similarly, if y 6≡ 1 mod 4, then one of y - 1, y - 2, y - 3 will be congruent to 1 mod 4. Since, 21 1 mod 4, the second player can always move to P-position during the game, and force the first player to lose. 1.5#4 Subtraction games (a) S = { 1 , 3 , 5 , 7 } . In this case P = { 0 , 2 , 4 ,..., 2 k,. .. } = { 2 k | k N } , the even numbers. To prove this we only have to note that using a step from S we always jump from even to odd numbers. (b) S = { 1 , 3 , 6 } . After computing a couple of positions, we guess that P = { x | x 0 , 2 , or 4 mod 9 } . We need to check that p + s / P , p P , s S , and also that s S such that n / P : n + s P . (c)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

solutions_hw1 - Solutions to homework 1 1.5#1 Mis`re...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online