There are two decks of cards, one with n playing cards and the other with m playing cards. Player A and B play alternately, performing one of the following operations in each turn: (i) Take out one card from one deck, (ii) Take out one card from each deck, (iii) Move one card from one deck to the other. The player that takes the last card wins and player A begins the game. Determine if there exists any winning strategy as a function of m and n so that one of the players following it can always win.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.