Problem 4. [15 points) Nika and Yida share an office. In their office, there are two cookie jars that each start with n
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Problem 4. [15 points) Nika and Yida share an office. In their office, there are two cookie jars that each start with n
Problem 4. [15 points) Nika and Yida share an office. In their office, there are two cookie jars that each start with n e z+ cookies. They make a friendly game by the following rules: 1. They take turns and eat cookies from the jars. 2. In one turn, one can only open one of the two jars, but they can take any number of cookies ke Z where 1 <k<n from that jar. 3. One wins the game if he/she takes the final cookie on his/her turn. Nika realizes that she has found a strategy such that Yida is always going to be the one loses the game. With n cookies in each jar, Nika lets Yida take the first turn. First, find Nika's strategy. Then, prove that it works for any number of cookies n by strong induction.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!