(New page: Show that Phi_n(x) is reducible if n is not prime.) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
Show that Phi_n(x) is reducible if n is not prime. | Show that Phi_n(x) is reducible if n is not prime. | ||
| + | |||
| + | |||
| + | For this one I modified the corollary for Eisenstein's Criterion to show that n divides all of the coefficients. | ||
| + | |||
| + | |||
| + | I used Eisenstein's Criterion with n=p^2, so that n is composite. So p divides all coefficients, and p^2 divides the last coefficient. This implies polynomial is reducible when p is not prime. | ||
| + | |||
| + | -Ozgur | ||
Latest revision as of 07:54, 16 November 2008
Show that Phi_n(x) is reducible if n is not prime.
For this one I modified the corollary for Eisenstein's Criterion to show that n divides all of the coefficients.
I used Eisenstein's Criterion with n=p^2, so that n is composite. So p divides all coefficients, and p^2 divides the last coefficient. This implies polynomial is reducible when p is not prime.
-Ozgur
