Difference between revisions of "Supplementary Question 4 MA453Fall2008walther" - Rhea

Revision as of 05: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.

Revision as of 15:17, 12 November 2008 (view source) Kabergma (Talk) (New page: Show that Phi_n(x) is reducible if n is not prime.)		Revision as of 05:03, 13 November 2008 (view source) Msharkey (Talk) Newer edit →
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.