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

k3232x · Nov 1, 2015

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].

Euge · Nov 1, 2015

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.

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

Similar threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?

I About the existence of Hamel basis for vector spaces

I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional

I How do we distinguish two different notations for cokernel and coimage?

I Localising a non integral domain at a prime

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Insights What Exactly is Dirac’s Delta Function? - Insight

Insights Relativator (Circular Slide-Rule): Simulated with Desmos - Insight

Insights Fixing Things Which Can Go Wrong With Complex Numbers