Combinatorics problem, right solution? Unicorn Meta Zoo #1: Why another podcast? ...
Mistake in years of experience in resume?
Prove that the countable union of countable sets is also countable
How to not starve gigantic beasts
Scheduling based problem
Philosophical question on logistic regression: why isn't the optimal threshold value trained?
Combinatorics problem, right solution?
view price of already bought and installed apps on play sotr
Why do real positive eigenvalues result in an unstable system? What about eigenvalues between 0 and 1? or 1?
Unable to completely uninstall Zoom meeting app
Crossed out red box fitting tightly around image
A Paper Record is What I Hamper
What does a straight horizontal line above a few notes, after a changed tempo mean?
A strange hotel
Unknown code in script
Negative Resistance
Is Diceware more secure than a long passphrase?
Has a Nobel Peace laureate ever been accused of war crimes?
Which big number is bigger?
Multiple fireplaces in an apartment building?
Does Mathematica have an implementation of the Poisson binomial distribution?
What is the best way to deal with NPC-NPC combat?
Is Electric Central Heating worth it if using Solar Panels?
How do I reattach a shelf to the wall when it ripped out of the wall?
How to keep bees out of canned beverages?
Combinatorics problem, right solution?
Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar Manaragraph theory /combinatorics committee existenceDifferent Perspectives of Multinomial Theorem & PartitionsCombination with at least two people.Is the assumption of the question violates itselfCounting word problemWhat is the minimum number of people required?Combinatorics: How should we count lists?combinatorics select committee different jobsIntuitive understanding of Pascal's IdentityWhy aren't these two solutions equivalent? Combinatorics problem
$begingroup$
We have $6$ lawyers, $7$ engineers and $4$ doctors. We plan on making a committee of $5$ people, and we want at least one person of each profession on board. So for the first place I choose an engineer, for the second a doctor and for the third a lawyer, leaving only $5$ laywers, $6$ engineers and $3$ doctors left.
For the remaining two places, I could have $2$ more people of a single profession. This is $binom{5}{2}+binom{6}{2}+binom{3}{2}$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom{5}{1}binom{3}{1}$; a doctor and an engineer, $binom{6}{1}binom{3}{1}$; or an engineer and a laywer $binom{6}{1}binom{5}{1}$.
This adds up to $binom{5}{2}+binom{6}{2}+binom{3}{2}+binom{5}{1}binom{3}{1}+binom{6}{1}binom{3}{1}+binom{6}{1}binom{5}{1}=91$ possible committees.
I have two questions regarding my approach to the problem. Question $a)$ is the reasoning right, am I not overcounting? $b)$ Even if it is right, is there a simpler way to do this? You can see that the sum I end up with, though relatively simple, is quite long and tedious.
Thanks in advance!
combinatorics discrete-mathematics order-theory
$endgroup$
add a comment |
$begingroup$
We have $6$ lawyers, $7$ engineers and $4$ doctors. We plan on making a committee of $5$ people, and we want at least one person of each profession on board. So for the first place I choose an engineer, for the second a doctor and for the third a lawyer, leaving only $5$ laywers, $6$ engineers and $3$ doctors left.
For the remaining two places, I could have $2$ more people of a single profession. This is $binom{5}{2}+binom{6}{2}+binom{3}{2}$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom{5}{1}binom{3}{1}$; a doctor and an engineer, $binom{6}{1}binom{3}{1}$; or an engineer and a laywer $binom{6}{1}binom{5}{1}$.
This adds up to $binom{5}{2}+binom{6}{2}+binom{3}{2}+binom{5}{1}binom{3}{1}+binom{6}{1}binom{3}{1}+binom{6}{1}binom{5}{1}=91$ possible committees.
I have two questions regarding my approach to the problem. Question $a)$ is the reasoning right, am I not overcounting? $b)$ Even if it is right, is there a simpler way to do this? You can see that the sum I end up with, though relatively simple, is quite long and tedious.
Thanks in advance!
combinatorics discrete-mathematics order-theory
$endgroup$
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago
add a comment |
$begingroup$
We have $6$ lawyers, $7$ engineers and $4$ doctors. We plan on making a committee of $5$ people, and we want at least one person of each profession on board. So for the first place I choose an engineer, for the second a doctor and for the third a lawyer, leaving only $5$ laywers, $6$ engineers and $3$ doctors left.
For the remaining two places, I could have $2$ more people of a single profession. This is $binom{5}{2}+binom{6}{2}+binom{3}{2}$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom{5}{1}binom{3}{1}$; a doctor and an engineer, $binom{6}{1}binom{3}{1}$; or an engineer and a laywer $binom{6}{1}binom{5}{1}$.
This adds up to $binom{5}{2}+binom{6}{2}+binom{3}{2}+binom{5}{1}binom{3}{1}+binom{6}{1}binom{3}{1}+binom{6}{1}binom{5}{1}=91$ possible committees.
I have two questions regarding my approach to the problem. Question $a)$ is the reasoning right, am I not overcounting? $b)$ Even if it is right, is there a simpler way to do this? You can see that the sum I end up with, though relatively simple, is quite long and tedious.
Thanks in advance!
combinatorics discrete-mathematics order-theory
$endgroup$
We have $6$ lawyers, $7$ engineers and $4$ doctors. We plan on making a committee of $5$ people, and we want at least one person of each profession on board. So for the first place I choose an engineer, for the second a doctor and for the third a lawyer, leaving only $5$ laywers, $6$ engineers and $3$ doctors left.
For the remaining two places, I could have $2$ more people of a single profession. This is $binom{5}{2}+binom{6}{2}+binom{3}{2}$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom{5}{1}binom{3}{1}$; a doctor and an engineer, $binom{6}{1}binom{3}{1}$; or an engineer and a laywer $binom{6}{1}binom{5}{1}$.
This adds up to $binom{5}{2}+binom{6}{2}+binom{3}{2}+binom{5}{1}binom{3}{1}+binom{6}{1}binom{3}{1}+binom{6}{1}binom{5}{1}=91$ possible committees.
I have two questions regarding my approach to the problem. Question $a)$ is the reasoning right, am I not overcounting? $b)$ Even if it is right, is there a simpler way to do this? You can see that the sum I end up with, though relatively simple, is quite long and tedious.
Thanks in advance!
combinatorics discrete-mathematics order-theory
combinatorics discrete-mathematics order-theory
edited 2 hours ago
Lafinur
asked 2 hours ago
LafinurLafinur
18211
18211
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago
add a comment |
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
1
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom {17}5$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom {11}5+binom {10}5+binom {13}5$$.
We then add back the cases in which all the people come from one profession. Thus we add back $$binom 65+binom 75$$
Thus the answer is $$binom {17}5-left(binom {11}5+binom {10}5+binom {13}5right)+left(binom 65+binom 75right)=boxed {4214}$$
$endgroup$
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom{17}5$ committees, ignoring the condition that each profession must appear. Then, for each profession, subtract the bad committees where that profession does not appear. So, subtract the $binom{13}5$ committees with no doctor, the $binom{11}5$ committees with no lawyer, and the $binom{10}5$ committees with no engineer. But then committees which are missing two particular professions have now been doubly subtracted, so these must be added back in to correct for this. For example, the $binom{7}5$ committees with no doctor or lawyer.
The result is
$$
binom{17}5-binom{13}5-binom{11}5-binom{10}5+ binom{7}5 +binom{6}5
$$
$endgroup$
add a comment |
$begingroup$
Let $A={(l,e,d)in{1,2,3,4,5,6}times{1,2,3,4,5,6,7}times{1,2,3,4}mid l+e+d=5}$
Then to be found is $$sum_{(l,e,d)in A}binom{6}{l}binom{7}{e}binom{4}{d}$$
Under the sketched conditions for equation $5=l+e+d$ we have the following possibilities:
- $5=3+1+1$
- $5=2+2+1$
- $5=2+1+2$
- $5=1+3+1$
- $5=1+2+2$
- $5=1+1+3$
This provides you a view on set $A$ and shows that the summation has $6$ terms.
$endgroup$
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
add a comment |
$begingroup$
There are 6 types of possible committees:
begin{array} {|r|r|r|}
hline
3&1&1 \
hline
1&3&1 \
hline
1&1&3 \
hline
2&2&1 \
hline
2&1&2 \
hline
1&2&2 \
hline
end{array}
For each type of committee, it is necessary to calculate the different groups of people that compose it:
begin{array} {|c|c|c|c|}
hline
3&1&1& {6choose3}{7choose1}{4choose1}= 20cdot7cdot4 = 560 \
hline
1&3&1& {6choose1}{7choose3}{4choose1}= 6cdot35cdot4 = 840 \
hline
1&1&3& {6choose1}{7choose1}{4choose3}= 6cdot7cdot4 = 168 \
hline
2&2&1& {6choose2}{7choose2}{4choose1}= 15cdot21cdot4 = 1260 \
hline
2&1&2& {6choose2}{7choose1}{4choose2}= 15cdot7cdot6 = 630 \
hline
1&2&2& {6choose1}{7choose2}{4choose2}= 6cdot21cdot6 = 756 \
hline
end{array}
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
$endgroup$
add a comment |
Your Answer
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%2f3202071%2fcombinatorics-problem-right-solution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom {17}5$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom {11}5+binom {10}5+binom {13}5$$.
We then add back the cases in which all the people come from one profession. Thus we add back $$binom 65+binom 75$$
Thus the answer is $$binom {17}5-left(binom {11}5+binom {10}5+binom {13}5right)+left(binom 65+binom 75right)=boxed {4214}$$
$endgroup$
add a comment |
$begingroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom {17}5$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom {11}5+binom {10}5+binom {13}5$$.
We then add back the cases in which all the people come from one profession. Thus we add back $$binom 65+binom 75$$
Thus the answer is $$binom {17}5-left(binom {11}5+binom {10}5+binom {13}5right)+left(binom 65+binom 75right)=boxed {4214}$$
$endgroup$
add a comment |
$begingroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom {17}5$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom {11}5+binom {10}5+binom {13}5$$.
We then add back the cases in which all the people come from one profession. Thus we add back $$binom 65+binom 75$$
Thus the answer is $$binom {17}5-left(binom {11}5+binom {10}5+binom {13}5right)+left(binom 65+binom 75right)=boxed {4214}$$
$endgroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom {17}5$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom {11}5+binom {10}5+binom {13}5$$.
We then add back the cases in which all the people come from one profession. Thus we add back $$binom 65+binom 75$$
Thus the answer is $$binom {17}5-left(binom {11}5+binom {10}5+binom {13}5right)+left(binom 65+binom 75right)=boxed {4214}$$
answered 2 hours ago
lulululu
44.1k25182
44.1k25182
add a comment |
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom{17}5$ committees, ignoring the condition that each profession must appear. Then, for each profession, subtract the bad committees where that profession does not appear. So, subtract the $binom{13}5$ committees with no doctor, the $binom{11}5$ committees with no lawyer, and the $binom{10}5$ committees with no engineer. But then committees which are missing two particular professions have now been doubly subtracted, so these must be added back in to correct for this. For example, the $binom{7}5$ committees with no doctor or lawyer.
The result is
$$
binom{17}5-binom{13}5-binom{11}5-binom{10}5+ binom{7}5 +binom{6}5
$$
$endgroup$
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom{17}5$ committees, ignoring the condition that each profession must appear. Then, for each profession, subtract the bad committees where that profession does not appear. So, subtract the $binom{13}5$ committees with no doctor, the $binom{11}5$ committees with no lawyer, and the $binom{10}5$ committees with no engineer. But then committees which are missing two particular professions have now been doubly subtracted, so these must be added back in to correct for this. For example, the $binom{7}5$ committees with no doctor or lawyer.
The result is
$$
binom{17}5-binom{13}5-binom{11}5-binom{10}5+ binom{7}5 +binom{6}5
$$
$endgroup$
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom{17}5$ committees, ignoring the condition that each profession must appear. Then, for each profession, subtract the bad committees where that profession does not appear. So, subtract the $binom{13}5$ committees with no doctor, the $binom{11}5$ committees with no lawyer, and the $binom{10}5$ committees with no engineer. But then committees which are missing two particular professions have now been doubly subtracted, so these must be added back in to correct for this. For example, the $binom{7}5$ committees with no doctor or lawyer.
The result is
$$
binom{17}5-binom{13}5-binom{11}5-binom{10}5+ binom{7}5 +binom{6}5
$$
$endgroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom{17}5$ committees, ignoring the condition that each profession must appear. Then, for each profession, subtract the bad committees where that profession does not appear. So, subtract the $binom{13}5$ committees with no doctor, the $binom{11}5$ committees with no lawyer, and the $binom{10}5$ committees with no engineer. But then committees which are missing two particular professions have now been doubly subtracted, so these must be added back in to correct for this. For example, the $binom{7}5$ committees with no doctor or lawyer.
The result is
$$
binom{17}5-binom{13}5-binom{11}5-binom{10}5+ binom{7}5 +binom{6}5
$$
answered 2 hours ago
Mike EarnestMike Earnest
28.6k22255
28.6k22255
add a comment |
add a comment |
$begingroup$
Let $A={(l,e,d)in{1,2,3,4,5,6}times{1,2,3,4,5,6,7}times{1,2,3,4}mid l+e+d=5}$
Then to be found is $$sum_{(l,e,d)in A}binom{6}{l}binom{7}{e}binom{4}{d}$$
Under the sketched conditions for equation $5=l+e+d$ we have the following possibilities:
- $5=3+1+1$
- $5=2+2+1$
- $5=2+1+2$
- $5=1+3+1$
- $5=1+2+2$
- $5=1+1+3$
This provides you a view on set $A$ and shows that the summation has $6$ terms.
$endgroup$
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
add a comment |
$begingroup$
Let $A={(l,e,d)in{1,2,3,4,5,6}times{1,2,3,4,5,6,7}times{1,2,3,4}mid l+e+d=5}$
Then to be found is $$sum_{(l,e,d)in A}binom{6}{l}binom{7}{e}binom{4}{d}$$
Under the sketched conditions for equation $5=l+e+d$ we have the following possibilities:
- $5=3+1+1$
- $5=2+2+1$
- $5=2+1+2$
- $5=1+3+1$
- $5=1+2+2$
- $5=1+1+3$
This provides you a view on set $A$ and shows that the summation has $6$ terms.
$endgroup$
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
add a comment |
$begingroup$
Let $A={(l,e,d)in{1,2,3,4,5,6}times{1,2,3,4,5,6,7}times{1,2,3,4}mid l+e+d=5}$
Then to be found is $$sum_{(l,e,d)in A}binom{6}{l}binom{7}{e}binom{4}{d}$$
Under the sketched conditions for equation $5=l+e+d$ we have the following possibilities:
- $5=3+1+1$
- $5=2+2+1$
- $5=2+1+2$
- $5=1+3+1$
- $5=1+2+2$
- $5=1+1+3$
This provides you a view on set $A$ and shows that the summation has $6$ terms.
$endgroup$
Let $A={(l,e,d)in{1,2,3,4,5,6}times{1,2,3,4,5,6,7}times{1,2,3,4}mid l+e+d=5}$
Then to be found is $$sum_{(l,e,d)in A}binom{6}{l}binom{7}{e}binom{4}{d}$$
Under the sketched conditions for equation $5=l+e+d$ we have the following possibilities:
- $5=3+1+1$
- $5=2+2+1$
- $5=2+1+2$
- $5=1+3+1$
- $5=1+2+2$
- $5=1+1+3$
This provides you a view on set $A$ and shows that the summation has $6$ terms.
edited 2 hours ago
answered 2 hours ago
drhabdrhab
105k545136
105k545136
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
add a comment |
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
2 hours ago
add a comment |
$begingroup$
There are 6 types of possible committees:
begin{array} {|r|r|r|}
hline
3&1&1 \
hline
1&3&1 \
hline
1&1&3 \
hline
2&2&1 \
hline
2&1&2 \
hline
1&2&2 \
hline
end{array}
For each type of committee, it is necessary to calculate the different groups of people that compose it:
begin{array} {|c|c|c|c|}
hline
3&1&1& {6choose3}{7choose1}{4choose1}= 20cdot7cdot4 = 560 \
hline
1&3&1& {6choose1}{7choose3}{4choose1}= 6cdot35cdot4 = 840 \
hline
1&1&3& {6choose1}{7choose1}{4choose3}= 6cdot7cdot4 = 168 \
hline
2&2&1& {6choose2}{7choose2}{4choose1}= 15cdot21cdot4 = 1260 \
hline
2&1&2& {6choose2}{7choose1}{4choose2}= 15cdot7cdot6 = 630 \
hline
1&2&2& {6choose1}{7choose2}{4choose2}= 6cdot21cdot6 = 756 \
hline
end{array}
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
$endgroup$
add a comment |
$begingroup$
There are 6 types of possible committees:
begin{array} {|r|r|r|}
hline
3&1&1 \
hline
1&3&1 \
hline
1&1&3 \
hline
2&2&1 \
hline
2&1&2 \
hline
1&2&2 \
hline
end{array}
For each type of committee, it is necessary to calculate the different groups of people that compose it:
begin{array} {|c|c|c|c|}
hline
3&1&1& {6choose3}{7choose1}{4choose1}= 20cdot7cdot4 = 560 \
hline
1&3&1& {6choose1}{7choose3}{4choose1}= 6cdot35cdot4 = 840 \
hline
1&1&3& {6choose1}{7choose1}{4choose3}= 6cdot7cdot4 = 168 \
hline
2&2&1& {6choose2}{7choose2}{4choose1}= 15cdot21cdot4 = 1260 \
hline
2&1&2& {6choose2}{7choose1}{4choose2}= 15cdot7cdot6 = 630 \
hline
1&2&2& {6choose1}{7choose2}{4choose2}= 6cdot21cdot6 = 756 \
hline
end{array}
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
$endgroup$
add a comment |
$begingroup$
There are 6 types of possible committees:
begin{array} {|r|r|r|}
hline
3&1&1 \
hline
1&3&1 \
hline
1&1&3 \
hline
2&2&1 \
hline
2&1&2 \
hline
1&2&2 \
hline
end{array}
For each type of committee, it is necessary to calculate the different groups of people that compose it:
begin{array} {|c|c|c|c|}
hline
3&1&1& {6choose3}{7choose1}{4choose1}= 20cdot7cdot4 = 560 \
hline
1&3&1& {6choose1}{7choose3}{4choose1}= 6cdot35cdot4 = 840 \
hline
1&1&3& {6choose1}{7choose1}{4choose3}= 6cdot7cdot4 = 168 \
hline
2&2&1& {6choose2}{7choose2}{4choose1}= 15cdot21cdot4 = 1260 \
hline
2&1&2& {6choose2}{7choose1}{4choose2}= 15cdot7cdot6 = 630 \
hline
1&2&2& {6choose1}{7choose2}{4choose2}= 6cdot21cdot6 = 756 \
hline
end{array}
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
$endgroup$
There are 6 types of possible committees:
begin{array} {|r|r|r|}
hline
3&1&1 \
hline
1&3&1 \
hline
1&1&3 \
hline
2&2&1 \
hline
2&1&2 \
hline
1&2&2 \
hline
end{array}
For each type of committee, it is necessary to calculate the different groups of people that compose it:
begin{array} {|c|c|c|c|}
hline
3&1&1& {6choose3}{7choose1}{4choose1}= 20cdot7cdot4 = 560 \
hline
1&3&1& {6choose1}{7choose3}{4choose1}= 6cdot35cdot4 = 840 \
hline
1&1&3& {6choose1}{7choose1}{4choose3}= 6cdot7cdot4 = 168 \
hline
2&2&1& {6choose2}{7choose2}{4choose1}= 15cdot21cdot4 = 1260 \
hline
2&1&2& {6choose2}{7choose1}{4choose2}= 15cdot7cdot6 = 630 \
hline
1&2&2& {6choose1}{7choose2}{4choose2}= 6cdot21cdot6 = 756 \
hline
end{array}
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
answered 1 hour ago
Angel MorenoAngel Moreno
45225
45225
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%2f3202071%2fcombinatorics-problem-right-solution%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
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
2 hours ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom {17}5=6188$ possible combinations.
$endgroup$
– lulu
2 hours ago
$begingroup$
When you say, for example, "pick a lawyer and then later possibly pick more lawyers", you're guaranteed to introduce an overcount. You might pick LawyerA first and then LawyerB or you might pick LawyerB first and then LawyerA. These are precisely the same subset of lawyers, but your counting scheme considers them to be different.
$endgroup$
– Austin Mohr
40 mins ago