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
How would this chord from "Rocket Man" be analyzed?
Why doesn't the standard consider a template constructor as a copy constructor?
What to do with someone that cheated their way through university and a PhD program?
My bank got bought out, am I now going to have to start filing tax returns in a different state?
What was Apollo 13's "Little Jolt" after MECO?
std::unique_ptr of base class holding reference of derived class does not show warning in gcc compiler while naked pointer shows it. Why?
Which big number is bigger?
The weakest link
Suing a Police Officer Instead of the Police Department
Mistake in years of experience in resume?
How do I prove this combinatorial identity
Can a stored procedure reference the database in which it is stored?
Is there any pythonic way to find average of specific tuple elements in array?
Are there moral objections to a life motivated purely by money? How to sway a person from this lifestyle?
Could moose/elk survive in the Amazon forest?
How exactly does Hawking radiation decrease the mass of black holes?
Bayes factor vs P value
Retract an already submitted recommendation letter (written for an undergrad student)
Why do games have consumables?
Why didn't the Space Shuttle bounce back into space as many times as possible so as to lose a lot of kinetic energy up there?
How much of a wave function must reside inside event horizon for it to be consumed by the black hole?
Where was the County of Thurn und Taxis located?
What makes accurate emulation of old systems a difficult task?
Is Diceware more secure than a long passphrase?
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 $binom52+binom62+binom32$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom51binom31$; a doctor and an engineer, $binom61binom31$; or an engineer and a laywer $binom61binom51$.
This adds up to $binom52+binom62+binom32+binom51binom31+binom61binom31+binom61binom51=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 $binom52+binom62+binom32$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom51binom31$; a doctor and an engineer, $binom61binom31$; or an engineer and a laywer $binom61binom51$.
This adds up to $binom52+binom62+binom32+binom51binom31+binom61binom31+binom61binom51=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
1 hour ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour 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 $binom52+binom62+binom32$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom51binom31$; a doctor and an engineer, $binom61binom31$; or an engineer and a laywer $binom61binom51$.
This adds up to $binom52+binom62+binom32+binom51binom31+binom61binom31+binom61binom51=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 $binom52+binom62+binom32$ possibilities.
I could also have two people of different professions; a doctor and a laywer, $binom51binom31$; a doctor and an engineer, $binom61binom31$; or an engineer and a laywer $binom61binom51$.
This adds up to $binom52+binom62+binom32+binom51binom31+binom61binom31+binom61binom51=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 1 hour ago
Lafinur
asked 1 hour ago
LafinurLafinur
18211
18211
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
1 hour ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour ago
add a comment |
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
1 hour ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour ago
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
1 hour ago
$begingroup$
I corrected it, I apologize. The result is the same though, it was just a typo.
$endgroup$
– Lafinur
1 hour ago
1
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour ago
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour 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 175$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom 115+binom 105+binom 135$$.
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 175-left(binom 115+binom 105+binom 135right)+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 $binom175$ 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 $binom135$ committees with no doctor, the $binom115$ committees with no lawyer, and the $binom105$ 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 $binom75$ committees with no doctor or lawyer.
The result is
$$
binom175-binom135-binom115-binom105+ binom75 +binom65
$$
$endgroup$
add a comment |
$begingroup$
Let $A=(l,e,d)in1,2,3,4,5,6times1,2,3,4,5,6,7times1,2,3,4mid l+e+d=5$
Then to be found is $$sum_(l,e,d)in Abinom6lbinom7ebinom4d$$
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
58 mins ago
add a comment |
$begingroup$
There are 6 types of possible committees:
beginarray 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
endarray
For each type of committee, it is necessary to calculate the different groups of people that compose it:
beginarray c
hline
3&1&1& 6choose37choose14choose1= 20cdot7cdot4 = 560 \
hline
1&3&1& 6choose17choose34choose1= 6cdot35cdot4 = 840 \
hline
1&1&3& 6choose17choose14choose3= 6cdot7cdot4 = 168 \
hline
2&2&1& 6choose27choose24choose1= 15cdot21cdot4 = 1260 \
hline
2&1&2& 6choose27choose14choose2= 15cdot7cdot6 = 630 \
hline
1&2&2& 6choose17choose24choose2= 6cdot21cdot6 = 756 \
hline
endarray
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 175$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom 115+binom 105+binom 135$$.
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 175-left(binom 115+binom 105+binom 135right)+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 175$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom 115+binom 105+binom 135$$.
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 175-left(binom 115+binom 105+binom 135right)+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 175$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom 115+binom 105+binom 135$$.
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 175-left(binom 115+binom 105+binom 135right)+left(binom 65+binom 75right)=boxed 4214$$
$endgroup$
I think Inclusion Exclusion is an easier approach.
If we ignore the restriction, there are $binom 175$ ways to choose the group.
We then exclude the choices which miss one specified profession. That's an exclusion of $$binom 115+binom 105+binom 135$$.
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 175-left(binom 115+binom 105+binom 135right)+left(binom 65+binom 75right)=boxed 4214$$
answered 1 hour 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 $binom175$ 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 $binom135$ committees with no doctor, the $binom115$ committees with no lawyer, and the $binom105$ 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 $binom75$ committees with no doctor or lawyer.
The result is
$$
binom175-binom135-binom115-binom105+ binom75 +binom65
$$
$endgroup$
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom175$ 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 $binom135$ committees with no doctor, the $binom115$ committees with no lawyer, and the $binom105$ 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 $binom75$ committees with no doctor or lawyer.
The result is
$$
binom175-binom135-binom115-binom105+ binom75 +binom65
$$
$endgroup$
add a comment |
$begingroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom175$ 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 $binom135$ committees with no doctor, the $binom115$ committees with no lawyer, and the $binom105$ 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 $binom75$ committees with no doctor or lawyer.
The result is
$$
binom175-binom135-binom115-binom105+ binom75 +binom65
$$
$endgroup$
I think it is easiest to use the principle of inclusion exclusion. Start with all $binom175$ 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 $binom135$ committees with no doctor, the $binom115$ committees with no lawyer, and the $binom105$ 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 $binom75$ committees with no doctor or lawyer.
The result is
$$
binom175-binom135-binom115-binom105+ binom75 +binom65
$$
answered 58 mins ago
Mike EarnestMike Earnest
28.6k22255
28.6k22255
add a comment |
add a comment |
$begingroup$
Let $A=(l,e,d)in1,2,3,4,5,6times1,2,3,4,5,6,7times1,2,3,4mid l+e+d=5$
Then to be found is $$sum_(l,e,d)in Abinom6lbinom7ebinom4d$$
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
58 mins ago
add a comment |
$begingroup$
Let $A=(l,e,d)in1,2,3,4,5,6times1,2,3,4,5,6,7times1,2,3,4mid l+e+d=5$
Then to be found is $$sum_(l,e,d)in Abinom6lbinom7ebinom4d$$
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
58 mins ago
add a comment |
$begingroup$
Let $A=(l,e,d)in1,2,3,4,5,6times1,2,3,4,5,6,7times1,2,3,4mid l+e+d=5$
Then to be found is $$sum_(l,e,d)in Abinom6lbinom7ebinom4d$$
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)in1,2,3,4,5,6times1,2,3,4,5,6,7times1,2,3,4mid l+e+d=5$
Then to be found is $$sum_(l,e,d)in Abinom6lbinom7ebinom4d$$
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 59 mins ago
answered 1 hour ago
drhabdrhab
105k545136
105k545136
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
58 mins ago
add a comment |
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
58 mins ago
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
58 mins ago
$begingroup$
@lulu Thank you lulu! Repaired.
$endgroup$
– drhab
58 mins ago
add a comment |
$begingroup$
There are 6 types of possible committees:
beginarray 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
endarray
For each type of committee, it is necessary to calculate the different groups of people that compose it:
beginarray c
hline
3&1&1& 6choose37choose14choose1= 20cdot7cdot4 = 560 \
hline
1&3&1& 6choose17choose34choose1= 6cdot35cdot4 = 840 \
hline
1&1&3& 6choose17choose14choose3= 6cdot7cdot4 = 168 \
hline
2&2&1& 6choose27choose24choose1= 15cdot21cdot4 = 1260 \
hline
2&1&2& 6choose27choose14choose2= 15cdot7cdot6 = 630 \
hline
1&2&2& 6choose17choose24choose2= 6cdot21cdot6 = 756 \
hline
endarray
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:
beginarray 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
endarray
For each type of committee, it is necessary to calculate the different groups of people that compose it:
beginarray c
hline
3&1&1& 6choose37choose14choose1= 20cdot7cdot4 = 560 \
hline
1&3&1& 6choose17choose34choose1= 6cdot35cdot4 = 840 \
hline
1&1&3& 6choose17choose14choose3= 6cdot7cdot4 = 168 \
hline
2&2&1& 6choose27choose24choose1= 15cdot21cdot4 = 1260 \
hline
2&1&2& 6choose27choose14choose2= 15cdot7cdot6 = 630 \
hline
1&2&2& 6choose17choose24choose2= 6cdot21cdot6 = 756 \
hline
endarray
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:
beginarray 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
endarray
For each type of committee, it is necessary to calculate the different groups of people that compose it:
beginarray c
hline
3&1&1& 6choose37choose14choose1= 20cdot7cdot4 = 560 \
hline
1&3&1& 6choose17choose34choose1= 6cdot35cdot4 = 840 \
hline
1&1&3& 6choose17choose14choose3= 6cdot7cdot4 = 168 \
hline
2&2&1& 6choose27choose24choose1= 15cdot21cdot4 = 1260 \
hline
2&1&2& 6choose27choose14choose2= 15cdot7cdot6 = 630 \
hline
1&2&2& 6choose17choose24choose2= 6cdot21cdot6 = 756 \
hline
endarray
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
$endgroup$
There are 6 types of possible committees:
beginarray 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
endarray
For each type of committee, it is necessary to calculate the different groups of people that compose it:
beginarray c
hline
3&1&1& 6choose37choose14choose1= 20cdot7cdot4 = 560 \
hline
1&3&1& 6choose17choose34choose1= 6cdot35cdot4 = 840 \
hline
1&1&3& 6choose17choose14choose3= 6cdot7cdot4 = 168 \
hline
2&2&1& 6choose27choose24choose1= 15cdot21cdot4 = 1260 \
hline
2&1&2& 6choose27choose14choose2= 15cdot7cdot6 = 630 \
hline
1&2&2& 6choose17choose24choose2= 6cdot21cdot6 = 756 \
hline
endarray
Adding 6 gives a total of different committees:
$$ 560+840+168+1260+630+756 = 4214 $$
answered 38 mins ago
Angel MorenoAngel Moreno
44225
44225
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
1 hour ago
1
$begingroup$
That number seems far too small. If you ignore the restriction there are $binom 175=6188$ possible combinations.
$endgroup$
– lulu
1 hour ago