Explanation Given information: a game of nim Proof: We prove this by strong induction. For the basis step, when n = 2 stones are in each pile, the first player isup a creek. If she takes two stones from a pile, then the second player takes one stone from the remaining pileand wins. If she takes one stone from a pile, then the second player takes two stones from the other pile andagain wins. Assume the inductive hypothesis that the second player can always win if the game starts withtwo piles of j stones for all j between 2 and k, inclusive, where k ≥ 2, and consider a game with two pilescontaining k + 1 stones each. If the first player takes all the stones from one of the piles, then the secondplayer takes all but one stone from the remaining pile and wins

DISCRETE MATHEMATICS LOOSELEAF W/CONNECT

8th Edition

ISBN: 9781264309405

Author: ROSEN

Publisher: MCG

See similar textbooks

Videos

Question

Chapter 11.2, Problem 39E

To determine

To prove:

If a game of nim begins with two piles containingthe same number of stones, as long as this number is atleast two, then the second player wins when both playersfollow optimal strategies.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 11.2, Problem 38E

Chapter 11.2, Problem 40E

Students have asked these similar questions

please answer the questions below ands provide the required codes in PYTHON. alsp provide explanation of how the codes were executed. Also make sure you provide codes that will be able to run even with different parameters as long as the output will be the same with any parameters given. these questions are not graded. provide accurate codes please

(1) Let F be a field, show that the vector space F,NEZ* be a finite dimension. (2) Let P2(x) be the vector space of polynomial of degree equal or less than two and M={a+bx+cx²/a,b,cЄ R,a+b=c),show that whether Mis hyperspace or not. (3) Let A and B be a subset of a vector space such that ACB, show that whether: (a) if A is convex then B is convex or not. (b) if B is convex then A is convex or not. (4) Let R be a field of real numbers and X=R, X is a vector space over R show that by definition the norms/II.II, and II.112 on X are equivalent where Ilxll₁ = max(lx,l, i=1,2,...,n) and llxll₂=(x²). oper (5) Let Ⓡ be a field of real numbers, Ⓡis a normed space under usual operations and norm, let E=(2,5,8), find int(E), b(E) and D(E). (6) Write the definition of bounded linear function between two normed spaces and write with prove the relation between continuous and bounded linear function between two normed spaces.

ind → 6 Q₁/(a) Let R be a field of real numbers and X-P(x)=(a+bx+cx²+dx/ a,b,c,dER},X is a vector space over R, show that is finite dimension. (b) Let be a bijective linear function from a finite dimension vector ✓ into a space Yand Sbe a basis for X, show that whether f(S) basis for or not. (c) Let be a vector space over a field F and A,B)affine subsets of X,show that whether aAn BB, aAU BB be affine subsets of X or not, a,ẞ EF. (12 Jal (answer only two) (6) Let M be a non-empty subset of a vector space X and tEX, show that M is a hyperspace of X iff t+M is a hyperplane of X and tЄt+M. (b) State Jahn-Banach theorem and write with prove an application of Hahn-

Chapter 11 Solutions

DISCRETE MATHEMATICS LOOSELEAF W/CONNECT

Ch. 11.1 - Prob. 1E Ch. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3E Ch. 11.1 - Prob. 4E Ch. 11.1 - Prob. 5E Ch. 11.1 - Prob. 6E Ch. 11.1 - Prob. 7E Ch. 11.1 - Prob. 8E Ch. 11.1 - Prob. 9E Ch. 11.1 - Prob. 10E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

To prove: If a game of nim begins with two piles containingthe same number of stones, as long as this number is atleast two, then the second player wins when both playersfollow optimal strategies.

Solution Summary: The author explains that a game of nim begins with two piles containing the same number of stones, as long as this number is atleast two, and proves this by strong induction.

Videos

To prove: If a game of nim begins with two piles containingthe same number of stones, as long as this number is atleast two, then the second player wins when both playersfollow optimal strategies.

Want to see the full answer?

Chapter 11 Solutions

To prove:

If a game of nim begins with two piles containingthe same number of stones, as long as this number is atleast two, then the second player wins when both playersfollow optimal strategies.