×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 5.2 - Problem 11e
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 5.2 - Problem 11e

×

# Consider this variation of the game of Nim. The game

ISBN: 9780073383095 37

## Solution for problem 11E Chapter 5.2

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 374 Reviews
21
4
Problem 11E

Consider this variation of the game of Nim. The game begins with n matches. Two players take turns removing matches, one, two. or three at a time. The player removing the last match loses. Use strong induction to show that if each player plays the best strategy possible, the first player wins if n = 4 j, 4j + 2, or 4j + 3 for some nonnegative integer j and the second player wins in the remaining case when n = 4j + 1 for some nonnegative integer j.

Step-by-Step Solution:
Step 1 of 3

Week 5 9/21 Live Event Television TV about TV ­ Television has power to manufacture televisable cultural events ­ event/awards shows have proliferated in last two decades ­ Cultural prizes have long history but modern televised event emphasize :the nation: watching together across time zones ­ Emmys are a way of legitimizing television itself ­ Also a performance by the industry for the industry Value of Live ­ Appointment viewing, red carpet, live transmission ­ Tweeting, fb messaging and news feeds: substitute for “live appointment viewing “ or enhancement ­ Value in events seen live, to conquer time shifting , skipping commercials, how would you characterise ads shown during the Emmys ­

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

The answer to “Consider this variation of the game of Nim. The game begins with n matches. Two players take turns removing matches, one, two. or three at a time. The player removing the last match loses. Use strong induction to show that if each player plays the best strategy possible, the first player wins if n = 4 j, 4j + 2, or 4j + 3 for some nonnegative integer j and the second player wins in the remaining case when n = 4j + 1 for some nonnegative integer j.” is broken down into a number of easy to follow steps, and 89 words. Since the solution to 11E from 5.2 chapter was answered, more than 447 students have viewed the full step-by-step answer. This full solution covers the following key subjects: player, Game, removing, wins, some. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The full step-by-step solution to problem: 11E from chapter: 5.2 was answered by , our top Math solution expert on 06/21/17, 07:45AM. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7.

#### Related chapters

Unlock Textbook Solution