Ways of arranging people around a round table such that persons of same nationality are separated.
$begingroup$
There are 3 Americans, 2 British, 1 Chinese, 1 Dutch and 1 Egyptian. They are to be arranged around a circular table so that persons of same nationality are separated.
(I found a similar thread on this site but wasn't able to get my answer since I am unable to form the case when ONLY two Americans are separated.
Ways of arranging of different nationality persons at a round table )
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
There are 3 Americans, 2 British, 1 Chinese, 1 Dutch and 1 Egyptian. They are to be arranged around a circular table so that persons of same nationality are separated.
(I found a similar thread on this site but wasn't able to get my answer since I am unable to form the case when ONLY two Americans are separated.
Ways of arranging of different nationality persons at a round table )
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
There are 3 Americans, 2 British, 1 Chinese, 1 Dutch and 1 Egyptian. They are to be arranged around a circular table so that persons of same nationality are separated.
(I found a similar thread on this site but wasn't able to get my answer since I am unable to form the case when ONLY two Americans are separated.
Ways of arranging of different nationality persons at a round table )
combinatorics permutations
$endgroup$
There are 3 Americans, 2 British, 1 Chinese, 1 Dutch and 1 Egyptian. They are to be arranged around a circular table so that persons of same nationality are separated.
(I found a similar thread on this site but wasn't able to get my answer since I am unable to form the case when ONLY two Americans are separated.
Ways of arranging of different nationality persons at a round table )
combinatorics permutations
combinatorics permutations
edited Dec 27 '18 at 19:47
Arpit Kumar
asked Dec 27 '18 at 8:18
Arpit KumarArpit Kumar
113
113
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I provide a startup for you.
Place an American.
Then $5$ spots are left for the other two Americans in the sense that they cannot be placed next to the one that has a seat already.
$binom52$ ways to find $2$ out of $5$ but - because they cannot sit next to each other $4$ possibilities fall out. Next to that as human beings they are distinguishable so order matters here.
This gives $2left(binom52-4right)=12$ possibilities.
These possibilities can be split in two specific configurations (make a picture to get view on this) of $6$.
Now start placing the $2$ British in both configurations.
I leave the rest to you.
$endgroup$
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
|
show 1 more 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%2f3053705%2fways-of-arranging-people-around-a-round-table-such-that-persons-of-same-national%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
$begingroup$
I provide a startup for you.
Place an American.
Then $5$ spots are left for the other two Americans in the sense that they cannot be placed next to the one that has a seat already.
$binom52$ ways to find $2$ out of $5$ but - because they cannot sit next to each other $4$ possibilities fall out. Next to that as human beings they are distinguishable so order matters here.
This gives $2left(binom52-4right)=12$ possibilities.
These possibilities can be split in two specific configurations (make a picture to get view on this) of $6$.
Now start placing the $2$ British in both configurations.
I leave the rest to you.
$endgroup$
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
|
show 1 more comment
$begingroup$
I provide a startup for you.
Place an American.
Then $5$ spots are left for the other two Americans in the sense that they cannot be placed next to the one that has a seat already.
$binom52$ ways to find $2$ out of $5$ but - because they cannot sit next to each other $4$ possibilities fall out. Next to that as human beings they are distinguishable so order matters here.
This gives $2left(binom52-4right)=12$ possibilities.
These possibilities can be split in two specific configurations (make a picture to get view on this) of $6$.
Now start placing the $2$ British in both configurations.
I leave the rest to you.
$endgroup$
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
|
show 1 more comment
$begingroup$
I provide a startup for you.
Place an American.
Then $5$ spots are left for the other two Americans in the sense that they cannot be placed next to the one that has a seat already.
$binom52$ ways to find $2$ out of $5$ but - because they cannot sit next to each other $4$ possibilities fall out. Next to that as human beings they are distinguishable so order matters here.
This gives $2left(binom52-4right)=12$ possibilities.
These possibilities can be split in two specific configurations (make a picture to get view on this) of $6$.
Now start placing the $2$ British in both configurations.
I leave the rest to you.
$endgroup$
I provide a startup for you.
Place an American.
Then $5$ spots are left for the other two Americans in the sense that they cannot be placed next to the one that has a seat already.
$binom52$ ways to find $2$ out of $5$ but - because they cannot sit next to each other $4$ possibilities fall out. Next to that as human beings they are distinguishable so order matters here.
This gives $2left(binom52-4right)=12$ possibilities.
These possibilities can be split in two specific configurations (make a picture to get view on this) of $6$.
Now start placing the $2$ British in both configurations.
I leave the rest to you.
answered Dec 27 '18 at 9:37
drhabdrhab
102k545136
102k545136
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
|
show 1 more comment
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Can't this be done by inclusion exclusion principle? We can take $E_1$ - Americans are sitting together and $E_2$ - British are sitting together
$endgroup$
– Sauhard Sharma
Dec 27 '18 at 10:32
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Oh Wow, finally got it! Thanks for the help. Luckily both the configurations of Americans yielded same number of purmutations.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 19:58
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
Also found an alternate solution to it by myself. I placed One British, Chinese, Dutch and Egyptian first. Then placed the remaining British either adjacent to the first British which forced me to place an American between the two or placed the second British alternate to the first one. Then I simply used gap method to fill in the Americans.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:02
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
I still wonder though, just as @Sauhard said, if we could use inclusion exclusion principle on it(though it would be quite long) . I tried it but as I said I failed to account for ONLY two Americans sitting together. I wonder if you could help me with that.
$endgroup$
– Arpit Kumar
Dec 27 '18 at 20:05
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
$begingroup$
@ArpitKumar I encountered (so understand) the same problem with that and for me it was a reason not to choose for PIE.
$endgroup$
– drhab
Dec 28 '18 at 8:42
|
show 1 more 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%2f3053705%2fways-of-arranging-people-around-a-round-table-such-that-persons-of-same-national%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