Revision as of 18:10, 8 April 2009 by Aifrank (Talk | contribs)

  • 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. ---

something by using the counter...?

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Question_4&oldid=22504"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Recent Math PhD now doing a post-doctorate at UC Riverside.

Kuei-Nuan Lin