Irreducible polynomial on polynomial ring

  • Thread starter Thread starter SN1987a
  • Start date Start date
  • Tags Tags
    Polynomial Ring
SN1987a
Messages
35
Reaction score
0
How would I prove that x^2+1 is irreducible in Z_p[x], where p is an odd prime of the form 3+4m.

I know that for it to be rreducible, it has to have roots in the ring. So x^2=-1 (mod p). Or x^2+1=k(3+4m), for some k. I tried induction on m, but it does not work because [itex}x^2+1[/itex] is only reducible on Z_p[x] if p is prime, which is not the case for all m. Apperently, there exists a two-line solution.

Any tips would be appreciated.
 
Physics news on Phys.org
Hint: Fermat's little theorem and this lemma: if R is a commutative ring with identity, and a in R is invertible, then a^n=1 and a^m=1 => a^gcd(n,m)=1.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top