circular r-permutations of n
My book, Discrete Mathematics And Its Applications by K.H.Rosen asks to find a formula for circular r-permutations of n people. That is, sitting of r of these people around a table when two sittings are considered equal if they look the same by rotation of the table.
As I searched, the answer must be, P(n,r)/2r but the book says something different:
The books answer.
So my problem is why? Why do we divide by r and not by 2 at the end?
And why didn't "design the head" step divide the answer by r?
combinatorics permutations
asked Dec 4 '18 at 16:23
AK 12
11
add a comment |
My book, Discrete Mathematics And Its Applications by K.H.Rosen asks to find a formula for circular r-permutations of n people. That is, sitting of r of these people around a table when two sittings are considered equal if they look the same by rotation of the table.
As I searched, the answer must be, P(n,r)/2r but the book says something different:
The books answer.
So my problem is why? Why do we divide by r and not by 2 at the end?
And why didn't "design the head" step divide the answer by r?
combinatorics permutations
asked Dec 4 '18 at 16:23
AK 12
11
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
1
"... rotating the table". That's where therfactor comes in. 2 is for reflection symmetry.
– karakfa
Dec 4 '18 at 17:43
add a comment |
My book, Discrete Mathematics And Its Applications by K.H.Rosen asks to find a formula for circular r-permutations of n people. That is, sitting of r of these people around a table when two sittings are considered equal if they look the same by rotation of the table.
As I searched, the answer must be, P(n,r)/2r but the book says something different:
The books answer.
So my problem is why? Why do we divide by r and not by 2 at the end?
And why didn't "design the head" step divide the answer by r?
combinatorics permutations
asked Dec 4 '18 at 16:23
AK 12
11
My book, Discrete Mathematics And Its Applications by K.H.Rosen asks to find a formula for circular r-permutations of n people. That is, sitting of r of these people around a table when two sittings are considered equal if they look the same by rotation of the table.
As I searched, the answer must be, P(n,r)/2r but the book says something different:
The books answer.
So my problem is why? Why do we divide by r and not by 2 at the end?
And why didn't "design the head" step divide the answer by r?
combinatorics permutations
combinatorics permutations
asked Dec 4 '18 at 16:23
AK 12
11
asked Dec 4 '18 at 16:23
AK 12
11
asked Dec 4 '18 at 16:23
AK 12
11
asked Dec 4 '18 at 16:23
AK 12
11
asked Dec 4 '18 at 16:23
AK 12
11
11
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
1
"... rotating the table". That's where therfactor comes in. 2 is for reflection symmetry.
– karakfa
Dec 4 '18 at 17:43
add a comment |
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
1
"... rotating the table". That's where therfactor comes in. 2 is for reflection symmetry.
– karakfa
Dec 4 '18 at 17:43
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
1
1
"... rotating the table". That's where the
r factor comes in. 2 is for reflection symmetry.– karakfa
Dec 4 '18 at 17:43
"... rotating the table". That's where the
r factor comes in. 2 is for reflection symmetry.– karakfa
Dec 4 '18 at 17:43
add a comment |
1 Answer
1
active
oldest
votes
What you probably got the answer is the "bracelet problem", what is being asked is the "necklace problem". The difference is the bracelet is assumed to be equivalent under reflection, whereas necklace is not. see wikipedia article here
answered Dec 4 '18 at 19:10
karakfa
1,973811
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%2f3025778%2fcircular-r-permutations-of-n%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
What you probably got the answer is the "bracelet problem", what is being asked is the "necklace problem". The difference is the bracelet is assumed to be equivalent under reflection, whereas necklace is not. see wikipedia article here
answered Dec 4 '18 at 19:10
karakfa
1,973811
add a comment |
What you probably got the answer is the "bracelet problem", what is being asked is the "necklace problem". The difference is the bracelet is assumed to be equivalent under reflection, whereas necklace is not. see wikipedia article here
answered Dec 4 '18 at 19:10
karakfa
1,973811
add a comment |
What you probably got the answer is the "bracelet problem", what is being asked is the "necklace problem". The difference is the bracelet is assumed to be equivalent under reflection, whereas necklace is not. see wikipedia article here
answered Dec 4 '18 at 19:10
karakfa
1,973811
What you probably got the answer is the "bracelet problem", what is being asked is the "necklace problem". The difference is the bracelet is assumed to be equivalent under reflection, whereas necklace is not. see wikipedia article here
answered Dec 4 '18 at 19:10
karakfa
1,973811
answered Dec 4 '18 at 19:10
karakfa
1,973811
answered Dec 4 '18 at 19:10
karakfa
1,973811
answered Dec 4 '18 at 19:10
karakfa
1,973811
1,973811
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%2f3025778%2fcircular-r-permutations-of-n%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
Think this way: How many ways can we seat $r$ people around a circular table? This is $r!/r$. To seat $r$ out of $n$ people, we first choose $r$ people in $binom{n}{r}$ ways and seat them in $(r-1)!$ ways.
– Muralidharan
Dec 4 '18 at 16:29
"As I searched, the answer must be, P(n,r)/2r" -- Since there are r seats and rotations don't count, you would divide by r. Why would you divide by 2?
– dcromley
Dec 4 '18 at 16:34
I think the issue is that you're counting reflections as being equivalent, but the book isn't.
– user3482749
Dec 4 '18 at 16:36
I divide by 2 because the as the book says "sittings are considered same, if they are obtained from each other by rotating the table."
– AK 12
Dec 4 '18 at 16:40
1
"... rotating the table". That's where the
rfactor comes in. 2 is for reflection symmetry.– karakfa
Dec 4 '18 at 17:43