Exercise 1. This software implements the "Mod $$p$$ irreducibility Test." (We assume that the degree of the polynomial is at most $$5$$ and that $$p$$ is at most $$11$$). Test your program with the examples given in this chapter and the polynomials given in exercise 12 (exercise 10 in the 7th edition).

Please enter the coefficients of the polynomial $$a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0$$ toger with a prime $$p$$ to be tested, then click the button.