and a circle 
in the plane. In addition to a normal straightedge, Carl has a special straightedge which, given a line 
and a point 
,
in some order.
![$P \in \mathbb Q[x,y]$](http://latex.artofproblemsolving.com/a/3/8/a384cbf38fd3a7f812b22baaeb0860e7f6eb26c0.png)
with 
and ![$\forall (a,b) \in \mathbb Z^2 \cap [0,d]^2, P(a,b) \in \mathbb Z$](http://latex.artofproblemsolving.com/a/6/5/a65ecb4bb2d9b5e6096f322c2de8bd11b945ed6a.png)
.
?
Y by
Let 
be an integer. Alice and Bob play the following game on the vertices of a regular 
-gon. Alice places her token on a vertex of the n-gon. Afterwards Bob places his token on another vertex of the n-gon. Then, with Alice playing first, they move their tokens alternately as follows for 
rounds: In Alice’s turn on the 
-th round, she moves her token positions clockwise or anticlockwise. In Bob’s turn on the -th round, he moves his token 
position clockwise or anticlockwise. If at the end of any person’s turn the two tokens are on the same vertex, then Alice wins the game, otherwise Bob wins. Decide for each value of which player has a winning strategy.
be an integer. Alice and Bob play the following game on the vertices of a regular 
-gon. Alice places her token on a vertex of the n-gon. Afterwards Bob places his token on another vertex of the n-gon. Then, with Alice playing first, they move their tokens alternately as follows for 
rounds: In Alice’s turn on the 
-th round, she moves her token positions clockwise or anticlockwise. In Bob’s turn on the -th round, he moves his token 
position clockwise or anticlockwise. If at the end of any person’s turn the two tokens are on the same vertex, then Alice wins the game, otherwise Bob wins. Decide for each value of which player has a winning strategy.
