Opposite Eisenstein's criteria

  • Thread starter Thread starter lola1990
  • Start date Start date
  • Tags Tags
    Criteria
Click For Summary
SUMMARY

The discussion centers on proving the irreducibility of the polynomial \( f(x) = a_n x^n + ... + a_1 x + a_0 \) under specific conditions related to prime divisibility. It is established that if a prime \( p \) divides the coefficients \( a_i \) for \( i = n, n-1, \ldots, 1 \) but does not divide \( a_0 \), and if \( p^2 \) does not divide \( a_n \), then \( f(x) \) is irreducible over the integers. The approach involves reducing the polynomial modulo \( p \) and analyzing the leading coefficients of the factors \( h(x) \) and \( g(x) \).

PREREQUISITES
  • Understanding of polynomial irreducibility in algebra
  • Familiarity with modular arithmetic and prime factorization
  • Knowledge of polynomial rings, specifically \( \mathbb{Z}[x] \)
  • Experience with the Eisenstein criterion for irreducibility
NEXT STEPS
  • Study the Eisenstein criterion for irreducibility in detail
  • Learn about polynomial factorization in \( \mathbb{Z}[x] \)
  • Explore modular arithmetic and its applications in number theory
  • Investigate examples of irreducible polynomials and their properties
USEFUL FOR

This discussion is beneficial for mathematicians, algebra students, and educators focusing on polynomial theory and irreducibility criteria in advanced algebra courses.

lola1990
Messages
30
Reaction score
0

Homework Statement


Homework Equations


The Attempt at a Solution

 
Last edited:
Physics news on Phys.org
Note, if you want to type in TeX, then you need to use the / slash. So it would have to be [ itex ] ... [ /itex ]

lola1990 said:

Homework Statement


Let f(x)=a_{n}x^{n}+...+a_{1}x+a_{0}. Let p be a prime and suppose p~|~ a_{i} for i in n,n-1...1 but p does not divide a_{0}. Show that if p^{2} does not divide a_{n}, then f(x) is irreducible.

Homework Equations


The Attempt at a Solution


Let f(x)=h(x)g(x) with h(x),g(x) in Z[x], and reduce mod p so that a_{0}=h(x)g(x). We have that if the leading coefficient of g(x) is g_{r} and the leading term of h(x) is h_{s} with r+s=n, p divides either coefficient but not both (because then the product would be divisible by p^{2}). Also, p does not divide the constant term of either polynomial. WLOG, suppose p divides g_{r} but not h_{s}. Now, I want to find a coefficient of f(x) so that I can force h_{s} to be divisible by p, but I'm not sure how... help!
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
40
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K