100%(11)11 out of 11 people found this document helpful
This preview shows page 2 - 4 out of 4 pages.
Stat 155, Spring 2017Homework 1Problem 3 (KP 1.2)Consider a game where there are two piles of chips. On a player’s turn, he may remove between1 and 4 chips from the first pile or else remove between 1 and 5 chips from the second pile. Theperson who takes the last chip wins. Determine for whichm, n∈Nit is the case that (m, n)∈P.Page 3