Adamu and Afaafa choose, each in his turn, positive integers as coefficients of a polynomial of degree n. Adamu wins if the polynomial obtained has an integer root; otherwise, Afaafa wins. Afaafa plays first if n is odd; otherwise Adamu plays first. Prove that:[*] Adamu has a winning strategy if n is odd.
[*] Afaafa has a winning strategy if n is even. gamecombinatoricspolynomialinteger rootalgebra