
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
November 1st, 2015, 09:39 AM  #1 
Newbie Joined: Nov 2015 From: Toronto Posts: 2 Thanks: 0  Prove the polynomial f(x)=x^2q is irreducible in F_p[x]?
If p and q are prime numbers such that p is not a quadratic residue mod q. Show that if pq=1 mod 4 then the polynomial f(x)=x^2q is irreducible in F_p[x].

November 1st, 2015, 12:09 PM  #2 
Senior Member Joined: Dec 2007 Posts: 687 Thanks: 47 
Checking Eisenstein's criterion might be useful: https://en.wikipedia.org/wiki/Eisenstein%27s_criterion 

Tags 
fpx, fxx2q, irreducible, polynomial, prove 
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 over Q  Dlarahasle  Algebra  0  February 13th, 2011 10:12 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  Number Theory  0  December 31st, 1969 04:00 PM 