Prove the polynomial f(x)=x^2-q is irreducible in F_p[x]?

MHB
Thread starter k3232x
Start date Nov 1, 2015
Tags

Polynomial

In summary, a polynomial is considered irreducible in a field F_p[x] if it cannot be factored into simpler polynomials with coefficients in the field. Proving a polynomial's irreducibility in F_p[x] is important for understanding the structure and properties of the field. The polynomial f(x)=x^2-q is significant because it is a monic and primitive polynomial, and proving its irreducibility in F_p[x] helps us understand the properties of this field. There are various methods to prove the irreducibility of a polynomial in F_p[x], such as Eisenstein's criterion and the rational root theorem. Lastly, f(x)=x^2-q can be irreducible in F_p[x] for all prime

Nov 1, 2015

k3232x

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^2-q is irreducible in F_p[x].

Physics news on Phys.org

Nov 1, 2015

Euge

Gold Member

MHB

POTW Director

Hi k3232x,

Welcome. (Wave) Please show what work you've done or what your thoughts are about this problem. That way, we can assist you better.

1. What does it mean for a polynomial to be irreducible in F_p[x]?

A polynomial is irreducible in F_p[x] if it cannot be factored into polynomials of lower degree with coefficients in the field F_p. In other words, it cannot be broken down into simpler factors in the field F_p.

2. Why is it important to prove that a polynomial is irreducible in F_p[x]?

Proving that a polynomial is irreducible in F_p[x] allows us to determine the structure and properties of the field F_p[x]. Additionally, it can help us determine if a polynomial has roots in a certain field or if it is a prime polynomial.

3. What is the significance of the polynomial f(x)=x^2-q in F_p[x]?

The polynomial f(x)=x^2-q is significant because it is a quadratic polynomial with a leading coefficient of 1, making it a monic polynomial. Additionally, it is a primitive polynomial, meaning it generates the field F_p[x]. Proving its irreducibility in F_p[x] is important in understanding the properties of this field.

4. How can we prove that f(x)=x^2-q is irreducible in F_p[x]?

There are a few different methods to prove the irreducibility of a polynomial in F_p[x]. One approach is to use the Eisenstein's criterion, which states that if a polynomial is of the form x^n + a_n-1x^n-1 + ... + a_1x + a_0, and there exists a prime number p that divides all coefficients except a_0 and p^2 does not divide a_0, then the polynomial is irreducible in F_p[x]. Another method is to use the rational root theorem to show that f(x)=x^2-q has no rational roots, and therefore cannot be factored.

5. Can f(x)=x^2-q be irreducible in F_p[x] for all prime numbers p?

Yes, f(x)=x^2-q can be irreducible in F_p[x] for all prime numbers p. This can be proven using the quadratic reciprocity theorem, which states that for any prime numbers p and q, if the Legendre symbol (p/q) is equal to -1, then x^2-q is irreducible in F_p[x]. Since there are infinitely many prime numbers that satisfy this condition, f(x)=x^2-q can be irreducible for infinitely many prime numbers.