Results 1 to 4 of 4

Math Help - Prove that for every prime p, there is an irreducible quadratic in Z_p[x]

  1. #1
    Junior Member Dark Sun's Avatar
    Joined
    Apr 2009
    From
    San Francisco, California
    Posts
    36
    Thanks
    1

    Prove that for every prime p, there is an irreducible quadratic in Z_p[x]

    Prove that for every prime p, there is an irreducible quadratic in Z_p[x] (the polynomial ring of the integers mod p).

    I have not been able to wrap my brain around this one. Does anyone have any ideas?

    I have been looking at x^2+x+1 and x^2+1, but haven't been able to derive a contradiction.

    This is what I have so far: Assume x^2+1 is reducible in Z_p[x]. Then, \exists a,b\in Z_p[x] s.t. x^2+1=(x-a)(x-b)=x^2-(a+b)x+ab\Rightarrow a+b=0, ab=1

    Thanks!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    May 2008
    Posts
    2,295
    Thanks
    7
    Quote Originally Posted by Dark Sun View Post
    Prove that for every prime p, there is an irreducible quadratic in Z_p[x] (the polynomial ring of the integers mod p).

    I have not been able to wrap my brain around this one. Does anyone have any ideas?

    I have been looking at x^2+x+1 and x^2+1, but haven't been able to derive a contradiction.

    This is what I have so far: Assume x^2+1 is reducible in Z_p[x]. Then, \exists a,b\in Z_p[x] s.t. x^2+1=(x-a)(x-b)=x^2-(a+b)x+ab\Rightarrow a+b=0, ab=1

    Thanks!
    if p = 2, consider x^2 + x + 1. for p > 2, choose a \in \{1, \cdots, p-1 \} such that a is not a quadratic residue modulo p. then x^2 - a would be irreducible in \mathbb{Z}_p[x].
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member Dark Sun's Avatar
    Joined
    Apr 2009
    From
    San Francisco, California
    Posts
    36
    Thanks
    1

    Thumbs up

    Thanks Dark Knight, this is just the answer I was looking for.

    You have helped me a great deal.

    I wish you well in your studies!
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by Dark Sun View Post
    Prove that for every prime p, there is an irreducible quadratic in Z_p[x] (the polynomial ring of the integers mod p).
    Here is another approach but this is not a good approach at all.

    Let f(x) = x^{p^2} - x and let K be its splitting field.
    Then we have that [K:F]=2, pick any a\in K - F then the minimal polynomial of a must have degree 2.
    Thus, you have found an irreducible polynomial of degree 2.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: April 10th 2011, 11:41 AM
  2. Replies: 2
    Last Post: September 10th 2010, 09:05 AM
  3. Irreducible but not prime
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: April 9th 2010, 02:21 PM
  4. Show that a prime is not irreducible in Z[i]
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: January 21st 2008, 01:12 PM
  5. Prime and Irreducible in Z[i]
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: January 17th 2008, 09:09 PM

Search Tags


/mathhelpforum @mathhelpforum