I'm having a problem with writing on paper things that I came up with. There's a Misere nim game with n stones, two players, every player can take 1, 2, 3 or 4 stones in one round, the one to remove the last stone loses. Nobody makes mistakes, find n at which the second player wins (has winning strategy) and prove it by induction. So I've got to the point that the pattern for 2nd player win is 5k+1 stones but I have no idea how to write it. Is it possible to do this with P(0), P(k), P(k+1)? Or you have to do the induction only using words? Or maybe it is way more advanced than the regular way? Thanks in advance.
2026-03-30 16:24:24.1774887864
Misere nim, 2nd player winning strategy proof by induction
1.2k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in DISCRETE-MATHEMATICS
- What is (mathematically) minimal computer architecture to run any software
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Given a function, prove that it's injective
- Surjective function proof
- How to find image of a function
- Find the truth value of... empty set?
- Solving discrete recursion equations with min in the equation
- Determine the marginal distributions of $(T_1, T_2)$
Related Questions in INDUCTION
- Show that the sequence is bounded below 3
- Fake induction, can't find flaw, every graph with zero edges is connected
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
- Prove $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$ using binomial and induction
- Induction proof of Fibonacci numbers
- The Martian Monetary System
- How to format a proof by induction
- $x+\frac{1}{x}$ is an integer
- Help with induction proof please! For an integer $n, 3$ divides $n^3-n$
- Proving $\sum_{k=1}^n kk!=(n+1)!−1$
Related Questions in COMBINATORIAL-GAME-THEORY
- Can Zermelo's theorem be extended to a game which always has a winner?
- Unrestricted Gomoku on a small board
- combinatorial game of sheets
- Analysis of a combinatorial game with prime numbers
- Even numbers combinatorial game
- Show that there exists at least one player who wins a trophy
- Tower Of Hanoi (4 Pegs)
- Queues and permutation/combination
- Maths strategy games
- Find number of solutions to special "Lights Out!" puzzle scenarios
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
HINT: For your induction step, show that if $5k+1$ is a win for the second player, then $5k+2,5k+3,5k+4$, and $5k+5$ are wins for the first player, and $5k+6=5(k+1)+1$ is a win for the second player. You do the first part of this by explaining how the first player wins from $5k+2,5k+3,5k+4$, and $5k+5$; you do the second part by showing that no matter what the first player does from $5k+6$, the second player has a winning response.