How can I reduce exponents in a field with modulo 7?
If I was working in a polynomial field with class of congruence to mod 7, so [0], [1], … , [6], and I wanted to reduce my exponents, for example if I had [2]x^103, how would I go about doing that?
elementary-number-theory modular-arithmetic
edited Nov 30 at 6:22
user1551
71.2k566125
asked Nov 30 at 6:11
ming
3165
add a comment |
If I was working in a polynomial field with class of congruence to mod 7, so [0], [1], … , [6], and I wanted to reduce my exponents, for example if I had [2]x^103, how would I go about doing that?
elementary-number-theory modular-arithmetic
edited Nov 30 at 6:22
user1551
71.2k566125
asked Nov 30 at 6:11
ming
3165
4
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58
add a comment |
If I was working in a polynomial field with class of congruence to mod 7, so [0], [1], … , [6], and I wanted to reduce my exponents, for example if I had [2]x^103, how would I go about doing that?
elementary-number-theory modular-arithmetic
edited Nov 30 at 6:22
user1551
71.2k566125
asked Nov 30 at 6:11
ming
3165
If I was working in a polynomial field with class of congruence to mod 7, so [0], [1], … , [6], and I wanted to reduce my exponents, for example if I had [2]x^103, how would I go about doing that?
elementary-number-theory modular-arithmetic
elementary-number-theory modular-arithmetic
edited Nov 30 at 6:22
user1551
71.2k566125
asked Nov 30 at 6:11
ming
3165
edited Nov 30 at 6:22
user1551
71.2k566125
asked Nov 30 at 6:11
ming
3165
edited Nov 30 at 6:22
user1551
71.2k566125
edited Nov 30 at 6:22
user1551
71.2k566125
edited Nov 30 at 6:22
user1551
71.2k566125
71.2k566125
asked Nov 30 at 6:11
ming
3165
asked Nov 30 at 6:11
ming
3165
asked Nov 30 at 6:11
ming
3165
3165
4
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58
add a comment |
4
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58
4
4
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58
add a comment |
active
oldest
votes
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%2f3019720%2fhow-can-i-reduce-exponents-in-a-field-with-modulo-7%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3019720%2fhow-can-i-reduce-exponents-in-a-field-with-modulo-7%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
4
Use Fermat's little theorem: $a^pequiv apmod p$ for $p$ prime.
– Lord Shark the Unknown
Nov 30 at 6:14
@LordSharktheUnknown Why are you answering in a comment?
– Arthur
Nov 30 at 6:58