- 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...?
I'm working on it, will update in a little while...
- --Nick Rupley 23:21, 8 April 2009 (UTC)
