Questions tagged [irreducible-polynomials]

Often called prime polynomials. Polynomials that have no polynomial divisors.

An irreducible or prime polynomial is a polynomial that has no polynomial factors. The parallel with prime integers is appropriate. In the same way that a prime number cannot be divided by any other integer other than $\pm1$, an irreducible polynomial cannot be divided by any polynomial other than a constant non-zero polynomial.

Though it is usually clear from context, care should be taken in observing the domain over which a polynomial is irreducible. For instance, $x^2+4x+13$ is irreducible over $\mathbb{R}$ but not $\mathbb{C}$; likewise, $x^3 + 2 x^2 + x + 3$ is irreducible over $\mathbb{F}_{5}$ but factors as $(x-1)(x-2)^2$ over $\mathbb{F}_7$.

3233 questions
0
votes
1 answer

Eisenstein criterion on almost cyclotomic polynomial

Let's consider the equation: $f(X) = x^5 + x^4 + x^3 + x^2 + x + 1$ How does one proof with the Eisenstein criterion (it has to be with this one) that this polynomial is irreducible in $\mathbb{Z}[X]$? I already tried to prove it for $f(X+1)$, since…
K.A.
  • 619
0
votes
2 answers

Irreducibility of a Given Polynomial

I'm starting to work with polynomial rings, and I've gotten to some problems related to irreducibility. I am trying to see if I'm approaching this problem correctly and how I can move forward with a solution. \ I want to prove that $x^2+1$ is…
user303459
0
votes
1 answer

Separable polynomials on field with char 2

On a field $K$ with $char(K)$ not equal to 2, all irreducible polynomials of a quadratic extension are separable. The proof is straightforward: Assume the opposite, namely $P=X^2+aX+b = (X-\alpha)(X-\beta)$ with $P \in K[X]$, so $a = -\alpha…
mdot
  • 947
0
votes
2 answers

Can two irreducible polynomials have different powers of the same real number as roots?

Say we have two irreducible polynomials in $Q [x] $. We call them $f, g$. Say one of the roots of $f $ is $a$. Is it possible that $g$ satisfies a root of the form $a^n$ for some natural number $n $? Thanks
user67803
0
votes
1 answer

Is there a more efficient way of counting the number of reducible polynomials?

Consider the set of polynomials with degree $n\leq 3$ with coefficients in $\mathbb{Z}_3$. A problem that I am working on is to determine the number of irreducible degree 3 monic polynomials. My approach to this is to slowly construct the reducible…
Trogdor
  • 10,331
0
votes
1 answer

Irreducible polynomial and its roots

Suppose I have a polynomial with rational coefficients which is irreducible over the rational numbers. Let $a$ be one of its roots. Can I express the other roots of this polynomial in terms of $a$ and if so how?
Timotej
  • 1,826
0
votes
0 answers

Showing that $x^n+x+3$ is irreducible

How do you show that $x^n+x+3$ is irreducible for all $n \ge 2$?
Sam J
  • 101
0
votes
2 answers

Irreducible polynomial

I am looking for all irreducible polynomials of degree 5 in $\mathbb{F}_{17}$ with have the form h(y) = $y^5+C$. I think there aren't any irreducible polynomials of this form because for every C I can find an element of $\mathbb{F}_{17}$ as a…
0
votes
1 answer

Irreducible Polynomials in $\mathbb F_{11}$

I'm searching all irreducible polynomials in $\mathbb{F}_{11} h(x) = x^3 + \ldots$ What is the fastest way to get it? I tried to factorize $x^{11\times3}-x$ but without success. Any advice?
0
votes
0 answers

Formula or pattern to find irreducible polynomials over $GF(2)$ and $GF(3)$

I have looked at many websites and forums and none were really that helpful. So my question is, is there an easy way such as a formula or pattern that you can create an irreducible polynomial over $GF(2)$ or $GF(3)$. I know that $x^2+x+1$ is an…
mctg
  • 1
0
votes
1 answer

Show that this polynomial is irreducible over Q

I have to show that the polynomial $1+x^p+x^{2p}+...x^{p^2-p}$ where p is a prime is irreducible over rationals. I am only looking for a hint. How should I go about this?
Maryam
  • 316
-1
votes
1 answer

Irreducible polynomials over GF(4)

Help me to find all (monic as well) irreducible second degree polynomials over the field GF(4). I know that GF(4) elements are {0,1,x,x+1} where x^2+x+1=0, and there are (4^2−4)/2=6 such irreducible polynomials, but can you name them? Like those are…
-1
votes
1 answer

Is this polynomial irreducible?

Let $n \in \mathbb{N}^*$ and $p$ be a prime number. Is the polynomial $f=X^{2n+1}+(p+1)X^{2n}+p \in \mathbb{Z}[X]$ irreducible?
-1
votes
1 answer

Is $\frac{p(x) - p(y)}{x-y}$ always irreducible?

Let $p$ be an integer polynomial. Is $\frac{p(x) - p(y)}{x-y}$ always irreducible over the integers ?
mick
  • 15,946
1 2 3
8
9