Proving Irreducibility of x^4 −7 Using Polynomial Theorems

Poirot1 · 2012-03-11T19:53:16+00:00

[FONT=CMR10][FONT=CMR10]Explain why the polynomial x^4[FONT=CMR7][FONT=CMR7] [FONT=CMSY10][FONT=CMSY10]−[FONT=CMR10][FONT=CMR10]7 is irreducible over [FONT=MSBM10][FONT=MSBM10]Q[FONT=CMR10][FONT=CMR10], quoting any theorems you use.

Topic:
Thread starter Poirot1
Start date Mar 11, 2012
Tags

Polynomial

Join the discussion

Registration is free. Start your own thread to ask a follow-up.

1 reply · 2K views

Poirot1

Thread starter
Mar 11, 2012

Explain why the polynomial x^4 −7 is irreducible over Q, quoting any theorems you use.

Physics news on Phys.org

Ultrathin materials could make quantum light circuits programmable
Spin rephasing helps quantum memories store single-photon states longer for future networks
Discovery confirms rare, switchable electrical property in widely used electronics material

Discussion

tarantella

Mar 11, 2012

Which theorems related to irreducibility do you know?

Proving Irreducibility of x^4 −7 Using Polynomial Theorems

Discussion

Similar threads

Undergrad Is There an Easier Proof for Proving Irreducibility of Polynomials?

Proving Irreducibility of Polynomials over the Integers

Proving Irreducibility of Primes in Z[√-5]

Proving Irreducibility of Polynomial Using Mod p Test and Einstein's Criterion

Proving Irreducibility of Polynomials in Fields