Prove Irreducibility of f(x) with Eisenstein's Criterion

  • Thread starter items
  • Start date
In summary, Eisenstein's Criterion is a mathematical theorem that can be used to prove the irreducibility of a polynomial. To use this criterion, the polynomial must have integer coefficients and there must be a prime number that divides all coefficients except the leading coefficient, and the square of that prime number cannot divide the constant term. Proving irreducibility is important in mathematics as it simplifies polynomials and makes them easier to solve. Other methods for proving irreducibility include the Rational Root Theorem, Eisenstein-Jacobi Criterion, and Reducibility by Descartes' Rule of Signs, each with its own criteria and applications.
  • #1
items
1
0
show irreducible.. f(x)=(p-1)x^p-2 + (p-2)x^(p-3) + ... + 3x^2 + 2x + 1 (p > 2 is prime)

hi,
Does anyone have ideal or hint on the poly. show irred.
try to us Eisenstein's Irreducibility Criterion, but dot kow how..

I try it...

diff(f(x)) = (p-1)(p-2)^p-3 + (p-2)(p-3)x^(p-40 + ... + 3*2^1 + 2

do't kow how to use diff(f(x)) and f(x)..

Thanks
 
Physics news on Phys.org
  • #2


Apply Eisenstein's criterion after substituting x=t+1.
 

What is Eisenstein's Criterion?

Eisenstein's Criterion is a mathematical theorem that can be used to prove the irreducibility of a polynomial. It states that if a polynomial has integer coefficients and there exists a prime number that divides all of the coefficients except the leading coefficient, and the square of that prime number does not divide the constant term, then the polynomial is irreducible.

How do you use Eisenstein's Criterion to prove irreducibility?

To prove irreducibility using Eisenstein's Criterion, you must first check that the polynomial has integer coefficients. Then, identify a prime number that divides all of the coefficients except the leading coefficient. Next, check that the square of that prime number does not divide the constant term. If these conditions are met, then the polynomial is irreducible.

Can Eisenstein's Criterion be used for all polynomials?

No, Eisenstein's Criterion can only be used for polynomials with integer coefficients. It also only applies to specific types of polynomials that meet the criteria outlined in the theorem.

What is the significance of proving irreducibility?

Proving irreducibility is important in mathematics because it allows us to simplify a polynomial into its irreducible factors. This can make it easier to solve equations and understand the behavior of the polynomial.

Are there any other methods for proving irreducibility?

Yes, there are other methods for proving irreducibility such as the Rational Root Theorem, the Eisenstein-Jacobi Criterion, and the Reducibility by Descartes' Rule of Signs. Each method has its own set of criteria and can be used in different situations.

Similar threads

I Irreducible polynomials and prime elements
    • Linear and Abstract Algebra
Replies
5
Views
924
MHB The polynomial is irreducible over Q(i)
    • Linear and Abstract Algebra
Replies
16
Views
2K
MHB Eisenstein polynomial and field extension
    • Linear and Abstract Algebra
Replies
24
Views
4K
I Generators of Galois group of ## X^n - \theta ##
    • Linear and Abstract Algebra
Replies
3
Views
1K
MHB Basic Theory of Field Extensions - Exercise from D&F ....
    • Linear and Abstract Algebra
Replies
2
Views
1K
MHB Showing a polynomial is irreducible
    • Linear and Abstract Algebra
Replies
1
Views
1K
MHB The irreducible polynomial is not separable
    • Linear and Abstract Algebra
Replies
1
Views
2K
MHB Prove the polynomial f(x)=x^2-q is irreducible in F_p[x]?
    • Linear and Abstract Algebra
Replies
1
Views
1K
MHB What does this relation hold?
    • Linear and Abstract Algebra
Replies
13
Views
3K
MHB Field Extensions, Polynomial Rings and Eisenstein's Criterion
    • Linear and Abstract Algebra
Replies
1
Views
1K

Hot Threads

Recent Insights

Back
Top