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

Why generator polynomial of $GF(2^m)$ are irreducible?

Why generator polynomial of the cyclic group $GF(2^m)$ are irreducible?
1
vote
1 answer

Example of a non-primitive but irreducible polynomial

A polynomial $f(x)=a_0+a_1x+......+a_nx^n\in R[x]$ where $R[x]$ is a polynomial ring over a ring $R$ is said to be primitive if $\gcd(a_0,a_1,a_2,......,a_n)$ is a unit. I could find examples of polynomials which are reducible but not…
Learnmore
  • 31,062
1
vote
2 answers

Show that a polynomial $f(x)$ over a field $k$ is irreducible if the polynomial $f(x+1)$ is irreducible

I was thinking of using contradiction by assuming that that $f(x)$ is reducible but I really don't know how to continue from that idea.
1
vote
1 answer

Existence of irreducible polynomial

I am looking for irreducible polynomials in $\mathbb{F}_{11}$ with the the form h(y) = $y^7+$. My considerations are: the group order is 10 and is relatively prime to the degree 7 of the polynomial. Therefore no irreducible polynomials exist of this…
0
votes
5 answers

Show polynomial is irreducible

Show that $x^4 + 4x^3 + 6x^2 + 2x + 1$ is irreducible over the field of rational numbers Q. Now I've tried substituting x-1 for x to show that it is irreducible, but I'm having a hard time. This is the correct way to go about it, I know, but I…
jerry2144
  • 643
0
votes
2 answers

irreducible polynomial over $Q(t_5)$

Consider $f(x)=x^5-5 \in \mathbb{Q}[x]$. I have already shown that f is irreducible. Now I want to prove that f is irreducible in $Q(t_5)[x]$, with $t_5=e^{\frac{i2\pi}{5}}$ but I have no idea how to start. Can anybody give me hint? Best, Redrose
RedRose
  • 81
0
votes
2 answers

Unique Factorization

I need help with the following: (i) Show that in R{x}, no polynomial of odd degree >1 is irreducible. The question is a bit confusing because I interpret it as Show that in R{x}, all polynomials of odd degree >1 are reducible. For example: $$x^5…
0
votes
0 answers

reduciblility of linear combination of two polynomials in $\Bbb R[x,y]$

For $f_1,f_2\in\Bbb R[x,y]$, let $S=\{k\in\Bbb R\mid kf_1+(1-k)f_2$ is not constant and reducible in $\Bbb R[x,y]\}$. It is easy to see $\#S$ can be $0,1,2,3$: $f_1=1,f_2=1$, then $S=\varnothing$, $\#S=0$. $f_1=xy,f_2=1$, then $S=\{1\}$,…
hbghlyj
  • 2,115
0
votes
3 answers

Is $x^4+15x^3+7$ irreductible on $\mathbb{Q}[x]$?

I have to discuss wether the polynomial $f(x)=x^4+15x^3+7$ is irreductible on $\mathbb{Q}[x]$. To show this I will use a combination between the Gauss Criterion and the Modular criterion, which states that Let $I$ be an ideal of $R$ and $f(x)\in…
0
votes
0 answers

Irreducible Polynomial examples in Gallian's Contemporary Abstract Algebra

In Chapter 17 of Gallian's Contemporary Abstract Algebra, 8th Edition, irreducible polynomials are defined as: in an integral domain $D$, whenever $f(x)$ from $D[x]$ is expressed as a product $f(x)=g(x)h(x)$, with $g(x)$ and $h(x)$ from $D[x]$, then…
0
votes
2 answers

Find the number of elements for which polynomial is irreducible

I have the following problem: Find the number of elements $\alpha \in F_{83}$ in the field of 83 elements for which the polynomial $t^2+5t+\alpha$ is irreducible. I tried finding the discriminant $25-4\alpha$ and setting $25-4\alpha<0$, but I…
0
votes
1 answer

The zero polynomial in a commutative ring with unity

Consider the polynonial $p(x)= 4x^2+8x-16 \in \mathbb{Z_4[x]}.$ My understanding is that this is equal to the zero polynomial in $\mathbb{Z_4[x]}$. I seem to be confused about determining whether $q(x)=x^2+x \in \mathbb{Z_2}[x]$ is also the zero…
coder22
  • 95
  • 5
0
votes
2 answers

Irreducibility of $x^4-32x^3+240x^2-320x-368=0$ over $\mathbb{Z}$

Prove that $x^4-32x^3+240x^2-320x-368=0$ is irreducible over $\mathbb{Z}$ My working :I've tried using Perron's irreducibility criterion but not applicable here, tried Cohn's irreducibility criterion and also tried Eisenstein's criterion but could…
Makar
  • 2,267
0
votes
0 answers

I cannot prove that $x$ is irreducible on $\mathbb{Q}[x,y]$.

I cannot prove that $x$ is irreducible on $\mathbb{Q}[x,y]$. My attempt is here: Assume that the following equation…
tchappy ha
  • 8,690
0
votes
2 answers

Proving irreducibility in $\Bbb Q[x]$

How can I prove $f(x) = x^3 - 3x^2 + 9$ is irreducible in $\Bbb Q[x]$? I tried doing $f(x+1)$ and then applying Eisenstein Theorem but it does not apply to $f(x+1) = x^3 - 3x + 7$
Gops76
  • 21
1 2 3
8 9