
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
February 13th, 2011, 10:12 AM  #1 
Newbie Joined: Feb 2011 Posts: 13 Thanks: 0  Irreducible polynomial over Q
I know about how to show that a polynomial is irreducible over Q using Eisenstein's criterion. But this does not work all the time. For instance, the polynomial: f(x) = x^3+3x^25x+4 Is irreducible over Q, but Eisenstein's criterion does not work here. Are there any other methods of showing that it is irreducible? Does these perchance involve what degrees g and h could have if f = g*h ? 

Tags 
irreducible, polynomial 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
irreducible polynomial  fleur  Abstract Algebra  4  April 15th, 2011 03:08 AM 
Irreducible polynomial of degree 2n+1  lime  Number Theory  5  September 23rd, 2010 02:01 AM 
Irreducible polynomial  Arczi1984  Abstract Algebra  4  February 16th, 2009 05:13 PM 
irreducible polynomial, cyclic group  numbertheory12  Abstract Algebra  0  December 9th, 2008 04:02 PM 
irreducible polynomial, cyclic group  numbertheory12  Number Theory  0  December 31st, 1969 04:00 PM 