Brian and Zayn play a game with a box, initially with cups numbered from to . Brian starts the game; they play alternatly, and at each move one of the players takes one of the cups still in the box. The game ends when there are only cups in the box. Brian wins the game if the numbers of the remaining two cups are coprime. If they are not, Zayn wins. Determine all the values of for which Zayn has a strategy that will make him 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
I tried thinking of it like this: if Nis odd then Brian ends the game which means that the only way he won't win is if the three numbers all have a common divisor ( different than 1 ). If it is even, then Zayn ends which means the only way he won't win is if the three numbers are coprime. I think that building on this it's possible to get somewhere but this is still very rudimentary.