The rules of the game are located in the attached image. Just to see what this game looks like, I'll run a quick easy example.
N=10. P1 must choose a divisor, d, of 10 (other than itself). P1 chooses 5. The difference of N and d is P2's new position.
N-d = 10-5 = 5
So 5 is P2's new position. P2 is forced to choose d=1 since 5 is prime, giving P1 a position of 4. 4 is what is called a "winning position", because if the player in this position plays ideally, he/she can always win.
P1 must choose a divisor of 4, and his choices are 1 and 2. All P1 needs to do to win is choose 1, which gives P2 a position of 3.
P2 is forced to choose 1 because 3 is prime, and P1 will win the game because he will make P2's score 1 in the end (2-1=1).
What is the ideal strategy for this game? How does your strategy depend on N?
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.