Ali and Naqi are playing a game. At first, they have Polynomial P(x)=1+x1398.
Naqi starts. In each turn one can choice natural number k∈[0,1398] in his trun, and add xk to the polynomial. For example after 2 moves P can be : P(x)=x1398+x300+x100+1. If after Ali's turn, there exist t∈R such that P(t)<0 then Ali loses the game. Prove that Ali can play forever somehow he never loses the game! combinatoricsGame Theoryalgebra