Chapter 5: Q27E (page 330)
Prove that for every positive integer n,
Short Answer
n is a positive integer, then
Chapter 5: Q27E (page 330)
Prove that for every positive integer n,
n is a positive integer, then
All the tools & learning materials you need for study success - in one app.
Get started for freeSuppose that you know that a golfer plays the first hole of
a golf course with an infinite number of holes and that if
this golfer plays one hole, then the golfer goes on to play
the next hole. Prove that this golfer plays every hole on
the course.
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. Using strong induction to show that if each player plays the best strategy possible, the first player wins if or for some nonnegative integer jand the second player wins in the remaining case when for some nonnegative integer j.
Prove that the recursive algorithm that you found in Exercise 7 is correct.
Prove that if and are sets such that , then
(a) Find the formula for by examining the values of this expression for small values of n.
(b) Prove the formula you conjectured in part (a).
What do you think about this solution?
We value your feedback to improve our textbook solutions.