(New page: Think I might be stumped on this problem. I was thinking to show that Eisenstein fails when n isn't prime, but I'm not sure how to do that.) |
|||
| Line 1: | Line 1: | ||
| + | *Show that <math>Phi_n(x)</math> is reducible if <math>n</math> is not prime. | ||
| + | |||
| + | ---- | ||
| + | |||
Think I might be stumped on this problem. I was thinking to show that Eisenstein fails when n isn't prime, but I'm not sure how to do that. | Think I might be stumped on this problem. I was thinking to show that Eisenstein fails when n isn't prime, but I'm not sure how to do that. | ||
Revision as of 17:59, 8 April 2009
- Show that $ Phi_n(x) $ is reducible if $ n $ is not prime.
Think I might be stumped on this problem. I was thinking to show that Eisenstein fails when n isn't prime, but I'm not sure how to do that.
