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
1
vote
1 answer

Is it true that $\forall f \in \mathbb{Z}[x],\exists p$ prime number, s.t. $ f $ is reducible in $\mathbb{F}_p$?

Is it true that $\forall f \in \mathbb{Z}[x],\exists p$ prime number, s.t. $ f $ is reducible in $\mathbb{F}_p$? I've seen this problem before but I can't find it. And when I try to understand the picture of $\operatorname{Spec}(\mathbb{Z}[x])$. I…
1
vote
1 answer

Irreducible polynomial in the extension k(x)/k(u).

If I consider $k$ a field of prime characteristic (maybe this is not important here...). Consider the field of fractions $k(x)$ and $u \in k(x)$ where $u=\frac{f(x)}{g(x)}$ where $f$ and $g$ are relatively prime. If we look at the extension of…
roi_saumon
  • 4,196
1
vote
1 answer

Does irreducibility in $\mathbb{F}_p[x]$ imply irreducibility in $\mathbb{Q}[x]$?

As per the title. I'm wondering if $f(x) \in \mathbb{Z}[x]$ is monic and has degree $\geq 2$ and $p$ is prime. I want to prove that if $f \mod n$ in $\mathbb{F}_p$ is irreducible, then $f$ is irreducible in $\mathbb{Q}[x]$. One approach I considered…
F. Yan
  • 167
1
vote
1 answer

Irreducible polynomials over an integrally closed domain

Let $A$ be an integrally closed domain, with quotient field $K_A$. My main question is the following: Question. Does any non constant irreducible polynomial of $A[X]$ stays irreducible in $K_A[X]$ ? Of course, this is true for monic non constant…
GreginGre
  • 15,028
1
vote
1 answer

If $f(X), g(X) \in \mathbb{Q} [X]$ and $f(X) = g(X) h(X)$ , is $h(X)\in\mathbb{Q} [X]$?

If $f(X), g(X) \in \mathbb{Q} [X]$ and $f(X) = g(X) h(X)$ , is $h(X)\in\mathbb{Q} [X]$ ? Probably this is really really basic, but just in case I am missing something... I think that in general $h$ may not be a polynomial, but if it is then is has…
1
vote
1 answer

Surjective Linear Integer Polynomial

Let $f(X)$ be a polynomial with integer coefficients such that $f : \mathbb{Z} \longrightarrow \mathbb{Z}$ is onto. Show that $f(X)=\pm X+c$ for some integer $c$. I was given this question in a lecture on irreducible polynomials. I think a solution…
doingmath
  • 419
1
vote
2 answers

which of the following polynomials are irreducible in $ \mathbb{Z}[x] $?

which of the following polynomials are irreducible in $ \mathbb{Z}[x] $? (a) $ x^{4}+10x+5 $, (b) $ x^{3}-2x+1 $, (c) $ x^{4}+x^{2}+1$, (d) $ x^{3}+x+1 $ My approach: Option (a) is true by Einstein's critera. option (b) is not true since x=1 is a…
MAS
  • 10,638
1
vote
0 answers
1
vote
1 answer

It's $(X+Y)^3- (X^2+Y^2)\in \mathbb{C}[X,Y]$ irreducible?

It's $(X+Y)^3- (X^2+Y^2)\in \mathbb{C}[X,Y]$ irreducible? I can't apply Eisenstein Criterion.
1
vote
0 answers

Moving a polynomial coefficient so it's irreducible

Given a polynomial over $Z$, $P(X)$, I'd like to show that for any $i$ in $N$, there is a whole number $r$ so that $P(x)+r*x^i$ is irreducible. I'd preferably would love a elementary argument so that I can understand it.
user157036
1
vote
4 answers

Is $x^4 + 4$ irreducible in $\mathbb{Z}_5$?

Well, I'm having doubts, isnt that $\mathbb{Z}_5$ has no zero divisors, and now you cant factor $x^4 + 4$ ?
1
vote
0 answers

Irreducible polynomials and Eisenstein's criterion.

I am looking for a counter-example for the following: If $p(x)$ is an irreducible polynomial over $Z[x]$, then there is a polynomial in $Z[x], q(x)$, so that $p(q(x))$ is irreducible by Eisenstein's criterion.
user157036
1
vote
0 answers

Irreducible polynomial $\; (x^2-2)^4-2$

I need to proof that $\; f(x)=(x^2-2)^4-2=x^8-8x^6+24x4-32x^2+14\;$ is irreducibel. I only know the eisenstein criterion and have no idea how to proof that this polynomial is irreducible. Any help would be appreciated
XPenguen
  • 2,301
1
vote
1 answer

question on testing irreducibility of a polynomial

currently reading a textbook which states the following - if a polynomial $f$ is reducible in $\mathbb{Z}$, so long $n$ does not divide the highest coefficient of $f$ it is irreducible in $\mathbb{Z}_n$. don't they mean the opposite? if that is the…
1
vote
1 answer

When does reducibility over $\mathbb{Z}_n$ imply reducibility over $\mathbb{Z}$

We know that If a polynomial $p$ is reducible over $\mathbb{Z}$, then it is reducible over $\mathbb{Z}_n$, but reducibility over $\mathbb{Z}_n$ doesn't always imply reducibility over $\mathbb{Z}$. My question is, are there certain conditions…
Trogdor
  • 10,331
1 2 3
8 9