Prove that $t^4 + t^3 + t^2 + t+1$ is not a primitive polynomial for $mathbb{F}_2$
$begingroup$
I tried showing that $f(t) = t^4 + t^3 + t^2 + t+1$ is reducible over $mathbb{F}_2$, but it turns out that $f(t)$ is irreducible. So I have to check whether or not $t$ is a primitive element of $mathbb{F}_2$, i.e. $t$ generates the cyclic group $mathbb{F}_1 ^* = { 1 }$. However $t^1 ne 1$ and therefore $f(t)$ is not primitive.
Is this correct? Thanks.
field-theory
$endgroup$
add a comment |
$begingroup$
I tried showing that $f(t) = t^4 + t^3 + t^2 + t+1$ is reducible over $mathbb{F}_2$, but it turns out that $f(t)$ is irreducible. So I have to check whether or not $t$ is a primitive element of $mathbb{F}_2$, i.e. $t$ generates the cyclic group $mathbb{F}_1 ^* = { 1 }$. However $t^1 ne 1$ and therefore $f(t)$ is not primitive.
Is this correct? Thanks.
field-theory
$endgroup$
add a comment |
$begingroup$
I tried showing that $f(t) = t^4 + t^3 + t^2 + t+1$ is reducible over $mathbb{F}_2$, but it turns out that $f(t)$ is irreducible. So I have to check whether or not $t$ is a primitive element of $mathbb{F}_2$, i.e. $t$ generates the cyclic group $mathbb{F}_1 ^* = { 1 }$. However $t^1 ne 1$ and therefore $f(t)$ is not primitive.
Is this correct? Thanks.
field-theory
$endgroup$
I tried showing that $f(t) = t^4 + t^3 + t^2 + t+1$ is reducible over $mathbb{F}_2$, but it turns out that $f(t)$ is irreducible. So I have to check whether or not $t$ is a primitive element of $mathbb{F}_2$, i.e. $t$ generates the cyclic group $mathbb{F}_1 ^* = { 1 }$. However $t^1 ne 1$ and therefore $f(t)$ is not primitive.
Is this correct? Thanks.
field-theory
field-theory
asked Jan 27 at 12:39
ZacharyZachary
1919
1919
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF$(p^m)$.
Definition, straight from Wikipedia. The root doesn't have to be in the base field. It shouldn't be in the base field.
Is the root going to be a primitive element in the larger field's multiplicative group? Well - this is a cyclotomic polynomial. Since $(t-1)f(t)=t^5-1$, any $t$ that is a root is a fifth root of unity. Since $1$ isn't a root, that means it's a primitive fifth root of unity. The only way that can generate the multiplicative group for a field is if that field has exactly five invertible elements - so, then, it has exactly six total elements. There are no such fields. No matter what prime we choose, this isn't a primitive polynomial.
$endgroup$
add a comment |
$begingroup$
As $f$ is irreducible, $f$ is primitive iff any of its zeros, $alpha$ say, generates the cyclic group $Bbb F_{2^4}^*$, which has order $15$. But $f(t)mid
(t^5-1)$ as polynomials, so $alpha^5=1$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3089511%2fprove-that-t4-t3-t2-t1-is-not-a-primitive-polynomial-for-mathbbf%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF$(p^m)$.
Definition, straight from Wikipedia. The root doesn't have to be in the base field. It shouldn't be in the base field.
Is the root going to be a primitive element in the larger field's multiplicative group? Well - this is a cyclotomic polynomial. Since $(t-1)f(t)=t^5-1$, any $t$ that is a root is a fifth root of unity. Since $1$ isn't a root, that means it's a primitive fifth root of unity. The only way that can generate the multiplicative group for a field is if that field has exactly five invertible elements - so, then, it has exactly six total elements. There are no such fields. No matter what prime we choose, this isn't a primitive polynomial.
$endgroup$
add a comment |
$begingroup$
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF$(p^m)$.
Definition, straight from Wikipedia. The root doesn't have to be in the base field. It shouldn't be in the base field.
Is the root going to be a primitive element in the larger field's multiplicative group? Well - this is a cyclotomic polynomial. Since $(t-1)f(t)=t^5-1$, any $t$ that is a root is a fifth root of unity. Since $1$ isn't a root, that means it's a primitive fifth root of unity. The only way that can generate the multiplicative group for a field is if that field has exactly five invertible elements - so, then, it has exactly six total elements. There are no such fields. No matter what prime we choose, this isn't a primitive polynomial.
$endgroup$
add a comment |
$begingroup$
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF$(p^m)$.
Definition, straight from Wikipedia. The root doesn't have to be in the base field. It shouldn't be in the base field.
Is the root going to be a primitive element in the larger field's multiplicative group? Well - this is a cyclotomic polynomial. Since $(t-1)f(t)=t^5-1$, any $t$ that is a root is a fifth root of unity. Since $1$ isn't a root, that means it's a primitive fifth root of unity. The only way that can generate the multiplicative group for a field is if that field has exactly five invertible elements - so, then, it has exactly six total elements. There are no such fields. No matter what prime we choose, this isn't a primitive polynomial.
$endgroup$
In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF$(p^m)$.
Definition, straight from Wikipedia. The root doesn't have to be in the base field. It shouldn't be in the base field.
Is the root going to be a primitive element in the larger field's multiplicative group? Well - this is a cyclotomic polynomial. Since $(t-1)f(t)=t^5-1$, any $t$ that is a root is a fifth root of unity. Since $1$ isn't a root, that means it's a primitive fifth root of unity. The only way that can generate the multiplicative group for a field is if that field has exactly five invertible elements - so, then, it has exactly six total elements. There are no such fields. No matter what prime we choose, this isn't a primitive polynomial.
answered Jan 27 at 12:49


jmerryjmerry
16.1k1633
16.1k1633
add a comment |
add a comment |
$begingroup$
As $f$ is irreducible, $f$ is primitive iff any of its zeros, $alpha$ say, generates the cyclic group $Bbb F_{2^4}^*$, which has order $15$. But $f(t)mid
(t^5-1)$ as polynomials, so $alpha^5=1$.
$endgroup$
add a comment |
$begingroup$
As $f$ is irreducible, $f$ is primitive iff any of its zeros, $alpha$ say, generates the cyclic group $Bbb F_{2^4}^*$, which has order $15$. But $f(t)mid
(t^5-1)$ as polynomials, so $alpha^5=1$.
$endgroup$
add a comment |
$begingroup$
As $f$ is irreducible, $f$ is primitive iff any of its zeros, $alpha$ say, generates the cyclic group $Bbb F_{2^4}^*$, which has order $15$. But $f(t)mid
(t^5-1)$ as polynomials, so $alpha^5=1$.
$endgroup$
As $f$ is irreducible, $f$ is primitive iff any of its zeros, $alpha$ say, generates the cyclic group $Bbb F_{2^4}^*$, which has order $15$. But $f(t)mid
(t^5-1)$ as polynomials, so $alpha^5=1$.
answered Jan 27 at 12:50
Lord Shark the UnknownLord Shark the Unknown
107k1162134
107k1162134
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3089511%2fprove-that-t4-t3-t2-t1-is-not-a-primitive-polynomial-for-mathbbf%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown