Inviting friends to dinner (combination/permutation)
$begingroup$
The head of a large company has 9 close friends.
a) In how many ways can he invite six of them to dinner?
b) Repeat a) if two of his friends are divorced, hate each other, and cannot both be invited.
c) Repeat a) if the friends consist of three single people and three married couples and if a husband or wife is invited, the spouse must be invited, too.
Part a is relatively straight forward. It would simply be $C(9,6)$ since the order in which he invites them does not matter.
Part b and c are a little more complicated and I'm not sure how to do them. Any help would be appreciated.
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
The head of a large company has 9 close friends.
a) In how many ways can he invite six of them to dinner?
b) Repeat a) if two of his friends are divorced, hate each other, and cannot both be invited.
c) Repeat a) if the friends consist of three single people and three married couples and if a husband or wife is invited, the spouse must be invited, too.
Part a is relatively straight forward. It would simply be $C(9,6)$ since the order in which he invites them does not matter.
Part b and c are a little more complicated and I'm not sure how to do them. Any help would be appreciated.
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
The head of a large company has 9 close friends.
a) In how many ways can he invite six of them to dinner?
b) Repeat a) if two of his friends are divorced, hate each other, and cannot both be invited.
c) Repeat a) if the friends consist of three single people and three married couples and if a husband or wife is invited, the spouse must be invited, too.
Part a is relatively straight forward. It would simply be $C(9,6)$ since the order in which he invites them does not matter.
Part b and c are a little more complicated and I'm not sure how to do them. Any help would be appreciated.
combinatorics permutations
$endgroup$
The head of a large company has 9 close friends.
a) In how many ways can he invite six of them to dinner?
b) Repeat a) if two of his friends are divorced, hate each other, and cannot both be invited.
c) Repeat a) if the friends consist of three single people and three married couples and if a husband or wife is invited, the spouse must be invited, too.
Part a is relatively straight forward. It would simply be $C(9,6)$ since the order in which he invites them does not matter.
Part b and c are a little more complicated and I'm not sure how to do them. Any help would be appreciated.
combinatorics permutations
combinatorics permutations
asked Dec 4 '13 at 22:33
micheal walmicheal wal
415
415
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For part b), how many ways can you choose the divorced couple AND four of the other seven individuals. So if the divorced couple is invited, then the remaining four choices are restricted to the remaining seven potential guests. Since we are excluding this case, the number of ways to invite six people is: $C(9,6) - C(7,4)$.
HINT: For part c), you either choose two singletons and 2 couples OR no singletons and 3 couples.
$endgroup$
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
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%2f593227%2finviting-friends-to-dinner-combination-permutation%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$
For part b), how many ways can you choose the divorced couple AND four of the other seven individuals. So if the divorced couple is invited, then the remaining four choices are restricted to the remaining seven potential guests. Since we are excluding this case, the number of ways to invite six people is: $C(9,6) - C(7,4)$.
HINT: For part c), you either choose two singletons and 2 couples OR no singletons and 3 couples.
$endgroup$
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
add a comment |
$begingroup$
For part b), how many ways can you choose the divorced couple AND four of the other seven individuals. So if the divorced couple is invited, then the remaining four choices are restricted to the remaining seven potential guests. Since we are excluding this case, the number of ways to invite six people is: $C(9,6) - C(7,4)$.
HINT: For part c), you either choose two singletons and 2 couples OR no singletons and 3 couples.
$endgroup$
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
add a comment |
$begingroup$
For part b), how many ways can you choose the divorced couple AND four of the other seven individuals. So if the divorced couple is invited, then the remaining four choices are restricted to the remaining seven potential guests. Since we are excluding this case, the number of ways to invite six people is: $C(9,6) - C(7,4)$.
HINT: For part c), you either choose two singletons and 2 couples OR no singletons and 3 couples.
$endgroup$
For part b), how many ways can you choose the divorced couple AND four of the other seven individuals. So if the divorced couple is invited, then the remaining four choices are restricted to the remaining seven potential guests. Since we are excluding this case, the number of ways to invite six people is: $C(9,6) - C(7,4)$.
HINT: For part c), you either choose two singletons and 2 couples OR no singletons and 3 couples.
edited Dec 4 '13 at 23:17
answered Dec 4 '13 at 22:53
Chris KChris K
2,6931814
2,6931814
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
add a comment |
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
@michaelwal: Please see the hint above. If you're still stuck, I'm willing to help as required.
$endgroup$
– Chris K
Dec 4 '13 at 22:54
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
I'm not sure...
$endgroup$
– micheal wal
Dec 4 '13 at 23:14
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
$begingroup$
@michaelwal: I'll add some details to show you how it's done.
$endgroup$
– Chris K
Dec 4 '13 at 23:15
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%2f593227%2finviting-friends-to-dinner-combination-permutation%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