Show that there are infinitely many reducible polynomials of the form $x^n+x+1$ in $mathbfF_2[x]$
Clash Royale CLAN TAG#URR8PPP
up vote
6
down vote
favorite
Here is a question from an old exam:
Show that there are infinite $nin mathbfN, A= x^n+x+1 $ which are reducible over $mathbfF_2[x]$.
Using André Nicolas' and Qiaochu Yuan's hint: $x^2+x+1$ as dividing polynomial. $x^2+x+1$ is irreducible over $mathbfF_2$. If an irreducible polynomial divides another polynomial which is not itself, that means that polynomial must be reducible. We want to show that $x^2+x+1$ divides all polynomials of the form $x^3n+5+x+1$. I can't figure the induction steps, but in $mathbfF_2$ the polynomial belongs to the residue class $tilde1$, therefore there must be an infnite amount of them.
Concerning Gerry Myerson's hint, how can I use cubic roots in $mathbfF_2$, wouldn't I need $mathbfR[i]$ for that?
Help is greatly appreciated.
ring-theory
 |Â
show 4 more comments
up vote
6
down vote
favorite
Here is a question from an old exam:
Show that there are infinite $nin mathbfN, A= x^n+x+1 $ which are reducible over $mathbfF_2[x]$.
Using André Nicolas' and Qiaochu Yuan's hint: $x^2+x+1$ as dividing polynomial. $x^2+x+1$ is irreducible over $mathbfF_2$. If an irreducible polynomial divides another polynomial which is not itself, that means that polynomial must be reducible. We want to show that $x^2+x+1$ divides all polynomials of the form $x^3n+5+x+1$. I can't figure the induction steps, but in $mathbfF_2$ the polynomial belongs to the residue class $tilde1$, therefore there must be an infnite amount of them.
Concerning Gerry Myerson's hint, how can I use cubic roots in $mathbfF_2$, wouldn't I need $mathbfR[i]$ for that?
Help is greatly appreciated.
ring-theory
2
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
1
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
2
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
1
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
2
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50
 |Â
show 4 more comments
up vote
6
down vote
favorite
up vote
6
down vote
favorite
Here is a question from an old exam:
Show that there are infinite $nin mathbfN, A= x^n+x+1 $ which are reducible over $mathbfF_2[x]$.
Using André Nicolas' and Qiaochu Yuan's hint: $x^2+x+1$ as dividing polynomial. $x^2+x+1$ is irreducible over $mathbfF_2$. If an irreducible polynomial divides another polynomial which is not itself, that means that polynomial must be reducible. We want to show that $x^2+x+1$ divides all polynomials of the form $x^3n+5+x+1$. I can't figure the induction steps, but in $mathbfF_2$ the polynomial belongs to the residue class $tilde1$, therefore there must be an infnite amount of them.
Concerning Gerry Myerson's hint, how can I use cubic roots in $mathbfF_2$, wouldn't I need $mathbfR[i]$ for that?
Help is greatly appreciated.
ring-theory
Here is a question from an old exam:
Show that there are infinite $nin mathbfN, A= x^n+x+1 $ which are reducible over $mathbfF_2[x]$.
Using André Nicolas' and Qiaochu Yuan's hint: $x^2+x+1$ as dividing polynomial. $x^2+x+1$ is irreducible over $mathbfF_2$. If an irreducible polynomial divides another polynomial which is not itself, that means that polynomial must be reducible. We want to show that $x^2+x+1$ divides all polynomials of the form $x^3n+5+x+1$. I can't figure the induction steps, but in $mathbfF_2$ the polynomial belongs to the residue class $tilde1$, therefore there must be an infnite amount of them.
Concerning Gerry Myerson's hint, how can I use cubic roots in $mathbfF_2$, wouldn't I need $mathbfR[i]$ for that?
Help is greatly appreciated.
ring-theory
edited Aug 23 at 5:57
Jyrki Lahtonen
105k12161358
105k12161358
asked Nov 16 '11 at 23:27
PumaDAce
1936
1936
2
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
1
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
2
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
1
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
2
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50
 |Â
show 4 more comments
2
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
1
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
2
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
1
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
2
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50
2
2
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
1
1
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
2
2
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
1
1
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
2
2
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50
 |Â
show 4 more comments
2 Answers
2
active
oldest
votes
up vote
6
down vote
accepted
Proof by induction.
Base case ($n=0$):
$$beginalign
(x^2+x+1)left(x^3+sumlimits_i=0^0 (x^3i+x^3i+2)right)&=(x^2+x+1)(x^3+x^2+1)\&=x^5+2x^4+2x^3+2x^2+x+1\&=x^5+x+1=x^3(0)+5+x+1
endalign$$ (working in $mathbbF_2[x]$).
Inductive hypothesis ($n geq 0$):
Suppose that $$(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)=x^3n+5+x+1$$
Then:
$$beginalign
&(x^2+x+1)left(x^3(n+2)+sumlimits_i=0^n+1 (x^3i+x^3i+2)right)=\
&(x^2+x+1)left(x^3(n+2)+x^3(n+1)+x^3(n+1)+2+sumlimits_i=0^n (x^3i+x^3i+2)right)=\
&(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) +
(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)
endalign$$
using our inductive hypothesis we get
$$beginalign
&=(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) + x^3n+5+x+1\
&=(x^2+x+1)(x^3n+6+x^3n+5) + x^3n+5+x+1\
&=x^3n+8+2x^3n+7+2x^3n+6+2x^3n+5+x+1\
&=x^3(n+1)+5+x+1
endalign$$
Therefore, $x^3(n+1)+5+x+1$ is reducible in $mathbbF_2[x]$ (or in any polynomial ring with coefficients in a field of characteristic 2) for all non-negative integers $n$.
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
add a comment |Â
up vote
8
down vote
As a variation on the (essentially equivalent) ideas in the answers and comments: we could ask that there be $alphain mathbb F_4$ solving $x^n+x+1=0$, noting that certainly there is no solution in $mathbb F_2$. For $alphain mathbb F_4$, $alpha^4=alpha$, and since $alphanot=0,1$, also $alpha^3=1$ and $alpha^2+alpha+1=0$. Thus,
$$
alpha^3n+2 + alpha + 1 = alpha^2+alpha+1 = 0
$$
Thus, $x^2+x+1$ divides $x^3n+2+x+1$.
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
6
down vote
accepted
Proof by induction.
Base case ($n=0$):
$$beginalign
(x^2+x+1)left(x^3+sumlimits_i=0^0 (x^3i+x^3i+2)right)&=(x^2+x+1)(x^3+x^2+1)\&=x^5+2x^4+2x^3+2x^2+x+1\&=x^5+x+1=x^3(0)+5+x+1
endalign$$ (working in $mathbbF_2[x]$).
Inductive hypothesis ($n geq 0$):
Suppose that $$(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)=x^3n+5+x+1$$
Then:
$$beginalign
&(x^2+x+1)left(x^3(n+2)+sumlimits_i=0^n+1 (x^3i+x^3i+2)right)=\
&(x^2+x+1)left(x^3(n+2)+x^3(n+1)+x^3(n+1)+2+sumlimits_i=0^n (x^3i+x^3i+2)right)=\
&(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) +
(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)
endalign$$
using our inductive hypothesis we get
$$beginalign
&=(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) + x^3n+5+x+1\
&=(x^2+x+1)(x^3n+6+x^3n+5) + x^3n+5+x+1\
&=x^3n+8+2x^3n+7+2x^3n+6+2x^3n+5+x+1\
&=x^3(n+1)+5+x+1
endalign$$
Therefore, $x^3(n+1)+5+x+1$ is reducible in $mathbbF_2[x]$ (or in any polynomial ring with coefficients in a field of characteristic 2) for all non-negative integers $n$.
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
add a comment |Â
up vote
6
down vote
accepted
Proof by induction.
Base case ($n=0$):
$$beginalign
(x^2+x+1)left(x^3+sumlimits_i=0^0 (x^3i+x^3i+2)right)&=(x^2+x+1)(x^3+x^2+1)\&=x^5+2x^4+2x^3+2x^2+x+1\&=x^5+x+1=x^3(0)+5+x+1
endalign$$ (working in $mathbbF_2[x]$).
Inductive hypothesis ($n geq 0$):
Suppose that $$(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)=x^3n+5+x+1$$
Then:
$$beginalign
&(x^2+x+1)left(x^3(n+2)+sumlimits_i=0^n+1 (x^3i+x^3i+2)right)=\
&(x^2+x+1)left(x^3(n+2)+x^3(n+1)+x^3(n+1)+2+sumlimits_i=0^n (x^3i+x^3i+2)right)=\
&(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) +
(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)
endalign$$
using our inductive hypothesis we get
$$beginalign
&=(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) + x^3n+5+x+1\
&=(x^2+x+1)(x^3n+6+x^3n+5) + x^3n+5+x+1\
&=x^3n+8+2x^3n+7+2x^3n+6+2x^3n+5+x+1\
&=x^3(n+1)+5+x+1
endalign$$
Therefore, $x^3(n+1)+5+x+1$ is reducible in $mathbbF_2[x]$ (or in any polynomial ring with coefficients in a field of characteristic 2) for all non-negative integers $n$.
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
add a comment |Â
up vote
6
down vote
accepted
up vote
6
down vote
accepted
Proof by induction.
Base case ($n=0$):
$$beginalign
(x^2+x+1)left(x^3+sumlimits_i=0^0 (x^3i+x^3i+2)right)&=(x^2+x+1)(x^3+x^2+1)\&=x^5+2x^4+2x^3+2x^2+x+1\&=x^5+x+1=x^3(0)+5+x+1
endalign$$ (working in $mathbbF_2[x]$).
Inductive hypothesis ($n geq 0$):
Suppose that $$(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)=x^3n+5+x+1$$
Then:
$$beginalign
&(x^2+x+1)left(x^3(n+2)+sumlimits_i=0^n+1 (x^3i+x^3i+2)right)=\
&(x^2+x+1)left(x^3(n+2)+x^3(n+1)+x^3(n+1)+2+sumlimits_i=0^n (x^3i+x^3i+2)right)=\
&(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) +
(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)
endalign$$
using our inductive hypothesis we get
$$beginalign
&=(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) + x^3n+5+x+1\
&=(x^2+x+1)(x^3n+6+x^3n+5) + x^3n+5+x+1\
&=x^3n+8+2x^3n+7+2x^3n+6+2x^3n+5+x+1\
&=x^3(n+1)+5+x+1
endalign$$
Therefore, $x^3(n+1)+5+x+1$ is reducible in $mathbbF_2[x]$ (or in any polynomial ring with coefficients in a field of characteristic 2) for all non-negative integers $n$.
Proof by induction.
Base case ($n=0$):
$$beginalign
(x^2+x+1)left(x^3+sumlimits_i=0^0 (x^3i+x^3i+2)right)&=(x^2+x+1)(x^3+x^2+1)\&=x^5+2x^4+2x^3+2x^2+x+1\&=x^5+x+1=x^3(0)+5+x+1
endalign$$ (working in $mathbbF_2[x]$).
Inductive hypothesis ($n geq 0$):
Suppose that $$(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)=x^3n+5+x+1$$
Then:
$$beginalign
&(x^2+x+1)left(x^3(n+2)+sumlimits_i=0^n+1 (x^3i+x^3i+2)right)=\
&(x^2+x+1)left(x^3(n+2)+x^3(n+1)+x^3(n+1)+2+sumlimits_i=0^n (x^3i+x^3i+2)right)=\
&(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) +
(x^2+x+1)left(x^3(n+1)+sumlimits_i=0^n (x^3i+x^3i+2)right)
endalign$$
using our inductive hypothesis we get
$$beginalign
&=(x^2+x+1)(x^3(n+2)+x^3(n+1)+2) + x^3n+5+x+1\
&=(x^2+x+1)(x^3n+6+x^3n+5) + x^3n+5+x+1\
&=x^3n+8+2x^3n+7+2x^3n+6+2x^3n+5+x+1\
&=x^3(n+1)+5+x+1
endalign$$
Therefore, $x^3(n+1)+5+x+1$ is reducible in $mathbbF_2[x]$ (or in any polynomial ring with coefficients in a field of characteristic 2) for all non-negative integers $n$.
edited Nov 17 '11 at 23:53
Asaf Karagilaâ¦
293k31409736
293k31409736
answered Nov 17 '11 at 23:26
Bill Cook
22.4k4467
22.4k4467
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
add a comment |Â
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
The $LaTeX$ was too long, so I tried to make it nicer while I chopped down the lines... I hope you don't mind.
â Asaf Karagilaâ¦
Nov 17 '11 at 23:53
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
@AsafKaragila Thanks! I had to run off to dinner with my wife and kids and didn't have time to tweak the LaTeX. It looks a lot better :)
â Bill Cook
Nov 18 '11 at 0:31
add a comment |Â
up vote
8
down vote
As a variation on the (essentially equivalent) ideas in the answers and comments: we could ask that there be $alphain mathbb F_4$ solving $x^n+x+1=0$, noting that certainly there is no solution in $mathbb F_2$. For $alphain mathbb F_4$, $alpha^4=alpha$, and since $alphanot=0,1$, also $alpha^3=1$ and $alpha^2+alpha+1=0$. Thus,
$$
alpha^3n+2 + alpha + 1 = alpha^2+alpha+1 = 0
$$
Thus, $x^2+x+1$ divides $x^3n+2+x+1$.
add a comment |Â
up vote
8
down vote
As a variation on the (essentially equivalent) ideas in the answers and comments: we could ask that there be $alphain mathbb F_4$ solving $x^n+x+1=0$, noting that certainly there is no solution in $mathbb F_2$. For $alphain mathbb F_4$, $alpha^4=alpha$, and since $alphanot=0,1$, also $alpha^3=1$ and $alpha^2+alpha+1=0$. Thus,
$$
alpha^3n+2 + alpha + 1 = alpha^2+alpha+1 = 0
$$
Thus, $x^2+x+1$ divides $x^3n+2+x+1$.
add a comment |Â
up vote
8
down vote
up vote
8
down vote
As a variation on the (essentially equivalent) ideas in the answers and comments: we could ask that there be $alphain mathbb F_4$ solving $x^n+x+1=0$, noting that certainly there is no solution in $mathbb F_2$. For $alphain mathbb F_4$, $alpha^4=alpha$, and since $alphanot=0,1$, also $alpha^3=1$ and $alpha^2+alpha+1=0$. Thus,
$$
alpha^3n+2 + alpha + 1 = alpha^2+alpha+1 = 0
$$
Thus, $x^2+x+1$ divides $x^3n+2+x+1$.
As a variation on the (essentially equivalent) ideas in the answers and comments: we could ask that there be $alphain mathbb F_4$ solving $x^n+x+1=0$, noting that certainly there is no solution in $mathbb F_2$. For $alphain mathbb F_4$, $alpha^4=alpha$, and since $alphanot=0,1$, also $alpha^3=1$ and $alpha^2+alpha+1=0$. Thus,
$$
alpha^3n+2 + alpha + 1 = alpha^2+alpha+1 = 0
$$
Thus, $x^2+x+1$ divides $x^3n+2+x+1$.
edited Nov 18 '11 at 2:53
answered Nov 17 '11 at 23:47
paul garrett
30.9k360116
30.9k360116
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f82859%2fshow-that-there-are-infinitely-many-reducible-polynomials-of-the-form-xnx1%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
2
Try to pick a quadratic polynomial $p$ with the property that $p | x^n + x + 1$ for infinitely many $n$.
â Qiaochu Yuan
Nov 16 '11 at 23:41
1
Maybe you should re-word the title of your question. An infinite amount of reducible polynomials?
â Dilip Sarwate
Nov 16 '11 at 23:46
2
A variant of Qiaochu's hint: let $alphane1$ be a complex cube root of 1. For which values of $n$ is $alpha$ a zero of $x^n+x+1$?
â Gerry Myerson
Nov 16 '11 at 23:53
1
So if a polynomial has a root, then it has a factor; two factors in this case, since there are two of these cube roots of 1.
â Gerry Myerson
Nov 17 '11 at 0:59
2
Look at $x^5+x+1=x^5-x^2+(x^2+x+1)$. Show that $x^2+x+1$ divides this polynomial. (The $-x^2$ is of course the same as $x^2$, just looks nicer.) Then look at $x^8+x+1=x^8-x^5+(x^5+x+1)$.
â André Nicolas
Nov 17 '11 at 4:50