Line 4: Line 4:
  
 
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.
 +
---
 +
 +
something by using the counter...?

Revision as of 18:10, 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. ---

something by using the counter...?

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett