Mixing
exponent of a finite group divides order of the group
Let $minBbb N$ be the exponent of a finite group $G $ ($|G|=n$). It' the smallest integer such that $g^m=e_G forall gin G$
Proving that $mmid |G|$ is the same as proving that the least common multiple of the orders of the elements of $G$ divides the order of the group once you realize the exponent is the LCM of $o(g)$ for $gin G$.
But how to conclude the proof?
I tried to reason with $q_icdot o(g_i)=|G| forall iin[n]$ but it doesn't seem to lead me enywhere
group-theory finite-groups
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
add a comment |
Let $minBbb N$ be the exponent of a finite group $G $ ($|G|=n$). It' the smallest integer such that $g^m=e_G forall gin G$
Proving that $mmid |G|$ is the same as proving that the least common multiple of the orders of the elements of $G$ divides the order of the group once you realize the exponent is the LCM of $o(g)$ for $gin G$.
But how to conclude the proof?
I tried to reason with $q_icdot o(g_i)=|G| forall iin[n]$ but it doesn't seem to lead me enywhere
group-theory finite-groups
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39
add a comment |
Let $minBbb N$ be the exponent of a finite group $G $ ($|G|=n$). It' the smallest integer such that $g^m=e_G forall gin G$
Proving that $mmid |G|$ is the same as proving that the least common multiple of the orders of the elements of $G$ divides the order of the group once you realize the exponent is the LCM of $o(g)$ for $gin G$.
But how to conclude the proof?
I tried to reason with $q_icdot o(g_i)=|G| forall iin[n]$ but it doesn't seem to lead me enywhere
group-theory finite-groups
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
Let $minBbb N$ be the exponent of a finite group $G $ ($|G|=n$). It' the smallest integer such that $g^m=e_G forall gin G$
Proving that $mmid |G|$ is the same as proving that the least common multiple of the orders of the elements of $G$ divides the order of the group once you realize the exponent is the LCM of $o(g)$ for $gin G$.
But how to conclude the proof?
I tried to reason with $q_icdot o(g_i)=|G| forall iin[n]$ but it doesn't seem to lead me enywhere
group-theory finite-groups
group-theory finite-groups
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
asked Nov 15 '18 at 13:16
John Cataldo
1,0511216
1,0511216
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39
add a comment |
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39
add a comment |
1 Answer
1
active
oldest
votes
Some hints: By Lagrange's Theorem, the order of every element of a finite group must divide the order of the group. In addition it implies that $a^{|G|}=e$ for all $ain G$.
answered Nov 21 '18 at 3:30
Alex Sanger
865
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%2f2999692%2fexponent-of-a-finite-group-divides-order-of-the-group%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Some hints: By Lagrange's Theorem, the order of every element of a finite group must divide the order of the group. In addition it implies that $a^{|G|}=e$ for all $ain G$.
answered Nov 21 '18 at 3:30
Alex Sanger
865
add a comment |
Some hints: By Lagrange's Theorem, the order of every element of a finite group must divide the order of the group. In addition it implies that $a^{|G|}=e$ for all $ain G$.
answered Nov 21 '18 at 3:30
Alex Sanger
865
add a comment |
Some hints: By Lagrange's Theorem, the order of every element of a finite group must divide the order of the group. In addition it implies that $a^{|G|}=e$ for all $ain G$.
answered Nov 21 '18 at 3:30
Alex Sanger
865
Some hints: By Lagrange's Theorem, the order of every element of a finite group must divide the order of the group. In addition it implies that $a^{|G|}=e$ for all $ain G$.
answered Nov 21 '18 at 3:30
Alex Sanger
865
answered Nov 21 '18 at 3:30
Alex Sanger
865
answered Nov 21 '18 at 3:30
Alex Sanger
865
answered Nov 21 '18 at 3:30
Alex Sanger
865
865
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.
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%2f2999692%2fexponent-of-a-finite-group-divides-order-of-the-group%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
Have you thought of showing that the prime-power divisors of the exponent divide the order of the group?
– ancientmathematician
Nov 15 '18 at 14:36
@ancientmathematician no, I'll try that
– John Cataldo
Nov 15 '18 at 14:39