(New page: Show that Phi_n(x) is reducible if n is not prime.) |
|||
| 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. | ||
Revision as of 06:03, 13 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.
