Let us analyze the game played by Susana and Brenda, where they write polynomials on the board.
### Rules Recap
1. Initially, Susana selects a positive integer n0 and writes the polynomial P0(x)=n0.
2. On her first turn, Brenda must choose a positive integer n1=n0 and write either:
P1(x)=n1x+P0(x)orP1(x)=n1x−P0(x).
3. For turn k, the player chooses a positive integer nk=n0,n1,…,nk−1 and writes either:
Pk(x)=nkxk+Pk−1(x)orPk(x)=nkxk−Pk−1(x).
4. The first player to write a polynomial with an integer root wins.
### Winning Strategy for Susana
1. Turn 0:
- Susana writes P0(x)=1.
2. Turn 1:
- Brenda, not allowed to use n1=1, writes either:
P1(x)=n1x+1orP1(x)=n1x−1.
- Neither of these polynomials have integer roots since for P1(x)=n1x+1 or P1(x)=n1x−1, solving for integer roots would require x=−n11 or x=n11, both of which are not integers as n1=±1.
3. Turn 2:
- Depending on Brenda's choice in Turn 1:
- If Brenda wrote P1(x)=n1x−1, Susana writes:
P2(x)=(n1+1)x2+n1x−1.
Substituting x=−1:
P2(−1)=(n1+1)(−1)2+n1(−1)−1=(n1+1)−n1−1=0,
Thus, −1 is a root, and Susana wins.
- If Brenda wrote P1(x)=n1x+1, Susana writes:
P2(x)=(n1+1)x2−n1x−1.
Substituting x=1:
P2(1)=(n1+1)(1)2−n1(1)−1=(n1+1)−n1−1=0,
Thus, 1 is a root, and Susana wins.
Based on this strategy, Susana ensures that no matter what polynomial Brenda writes on Turn 1, Susana can always write a polynomial on Turn 2 that has an integer root. Therefore, the solution allows Susana to win the game by setting up the situation in such a way that Brenda's choices do not affect the outcome by Turn 2.
The strategy can be concluded with the realization that Susana has a winning path by carefully managing her choices:
Susana wins by writing P2(x) that has +1 or −1 as a root.