How many permutations of order $8$ in $S_{10}$?
$begingroup$
Find the number of permutations of order $8$ in $S_{10}$. If $sigma$ is one of them, find the number of subgroups in the subgroup generated by $sigma$.
group-theory discrete-mathematics permutations
$endgroup$
add a comment |
$begingroup$
Find the number of permutations of order $8$ in $S_{10}$. If $sigma$ is one of them, find the number of subgroups in the subgroup generated by $sigma$.
group-theory discrete-mathematics permutations
$endgroup$
3
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
1
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
2
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25
add a comment |
$begingroup$
Find the number of permutations of order $8$ in $S_{10}$. If $sigma$ is one of them, find the number of subgroups in the subgroup generated by $sigma$.
group-theory discrete-mathematics permutations
$endgroup$
Find the number of permutations of order $8$ in $S_{10}$. If $sigma$ is one of them, find the number of subgroups in the subgroup generated by $sigma$.
group-theory discrete-mathematics permutations
group-theory discrete-mathematics permutations
edited Jan 22 at 19:49
Did
248k23224463
248k23224463
asked Jan 22 at 19:39
JackJack
344
344
3
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
1
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
2
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25
add a comment |
3
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
1
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
2
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25
3
3
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
1
1
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
2
2
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Hint:
The order of a permutation decomposed as a product of disjoint cycles is the l.c.m. of the orders of the cycles, i.e. the l.c.m. of the lengths of the cycles.
$endgroup$
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
add a comment |
$begingroup$
An element of $S_{10}$ has order $8$ iff its cycle type is $(8,1,1)$ or $(8,2)$.
There are are ${10choose 8}cdot7!$ of type $(8,1,1)$. There are ${10choose 8}cdot 7!$ of type $(8,2)$.
Together we get $900cdot7!$
If $sigma$ is one of them, $langlesigma rangle $ is cyclic of order $8$. Therefore there are two proper subgroups, of orders $2$ and $4$, other than ${e}$.
$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%2f3083614%2fhow-many-permutations-of-order-8-in-s-10%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$
Hint:
The order of a permutation decomposed as a product of disjoint cycles is the l.c.m. of the orders of the cycles, i.e. the l.c.m. of the lengths of the cycles.
$endgroup$
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
add a comment |
$begingroup$
Hint:
The order of a permutation decomposed as a product of disjoint cycles is the l.c.m. of the orders of the cycles, i.e. the l.c.m. of the lengths of the cycles.
$endgroup$
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
add a comment |
$begingroup$
Hint:
The order of a permutation decomposed as a product of disjoint cycles is the l.c.m. of the orders of the cycles, i.e. the l.c.m. of the lengths of the cycles.
$endgroup$
Hint:
The order of a permutation decomposed as a product of disjoint cycles is the l.c.m. of the orders of the cycles, i.e. the l.c.m. of the lengths of the cycles.
edited Jan 22 at 20:45
answered Jan 22 at 19:53
BernardBernard
121k740116
121k740116
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
add a comment |
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
I think this needs some editing
$endgroup$
– J. W. Tanner
Jan 22 at 20:42
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
@J.W.Tanner: Oh! yes. I've fixed it. Thanks for pointing the mistyping!
$endgroup$
– Bernard
Jan 22 at 20:46
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
$begingroup$
You are welcome !
$endgroup$
– J. W. Tanner
Jan 22 at 20:51
add a comment |
$begingroup$
An element of $S_{10}$ has order $8$ iff its cycle type is $(8,1,1)$ or $(8,2)$.
There are are ${10choose 8}cdot7!$ of type $(8,1,1)$. There are ${10choose 8}cdot 7!$ of type $(8,2)$.
Together we get $900cdot7!$
If $sigma$ is one of them, $langlesigma rangle $ is cyclic of order $8$. Therefore there are two proper subgroups, of orders $2$ and $4$, other than ${e}$.
$endgroup$
add a comment |
$begingroup$
An element of $S_{10}$ has order $8$ iff its cycle type is $(8,1,1)$ or $(8,2)$.
There are are ${10choose 8}cdot7!$ of type $(8,1,1)$. There are ${10choose 8}cdot 7!$ of type $(8,2)$.
Together we get $900cdot7!$
If $sigma$ is one of them, $langlesigma rangle $ is cyclic of order $8$. Therefore there are two proper subgroups, of orders $2$ and $4$, other than ${e}$.
$endgroup$
add a comment |
$begingroup$
An element of $S_{10}$ has order $8$ iff its cycle type is $(8,1,1)$ or $(8,2)$.
There are are ${10choose 8}cdot7!$ of type $(8,1,1)$. There are ${10choose 8}cdot 7!$ of type $(8,2)$.
Together we get $900cdot7!$
If $sigma$ is one of them, $langlesigma rangle $ is cyclic of order $8$. Therefore there are two proper subgroups, of orders $2$ and $4$, other than ${e}$.
$endgroup$
An element of $S_{10}$ has order $8$ iff its cycle type is $(8,1,1)$ or $(8,2)$.
There are are ${10choose 8}cdot7!$ of type $(8,1,1)$. There are ${10choose 8}cdot 7!$ of type $(8,2)$.
Together we get $900cdot7!$
If $sigma$ is one of them, $langlesigma rangle $ is cyclic of order $8$. Therefore there are two proper subgroups, of orders $2$ and $4$, other than ${e}$.
edited Jan 24 at 17:04
answered Jan 23 at 1:18
Chris CusterChris Custer
13.9k3827
13.9k3827
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%2f3083614%2fhow-many-permutations-of-order-8-in-s-10%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
3
$begingroup$
Do you know about cycle decomposition? Do you know how to find the order of a permutation given its cycle decomposition?
$endgroup$
– Mark
Jan 22 at 19:42
1
$begingroup$
Where is your input?
$endgroup$
– Did
Jan 22 at 19:50
$begingroup$
I can think of ${10choose 8}=45$ for starters. That is, the $8$-cycles. But there are surely others. Oh yeah, you can change their order. So, multiply by $8!$?
$endgroup$
– Chris Custer
Jan 22 at 19:51
2
$begingroup$
@Chris Custer, no, you multiply by $7!$. Once you choose the image of $7$ elements in the cycle the last element has just one option.
$endgroup$
– Mark
Jan 22 at 19:56
$begingroup$
@Mark actually I think the reason is you can cyclically permute each $8$-cycle $8$ ways
$endgroup$
– Chris Custer
Jan 23 at 1:25