The number of ways of choosing with parametersDifferent ways of coloring a $4 times 4$ game boardWhat does...
Should a cast be used to truncate a long variable?
Icon at Subject-line scrlttr2
Other than edits for international editions, did Harry Potter and the Philosopher's Stone receive errata?
Where does documentation like business and software requirement spec docs fit in an agile project?
Is the fingering of thirds flexible or do I have to follow the rules?
Eww, those bytes are gross
How to deal with an underperforming subordinate?
The No-Straight Maze
Why is 'diphthong' not pronounced otherwise?
What kind of places would goblins live in a fantasy setting with strong states?
How is this property called for mod?
What are some ways of extending a description of a scenery?
How much light is too much?
How to politely refuse in-office gym instructor for steroids and protein
Case protection with emphasis in biblatex
Is there any danger of my neighbor having my wife's signature?
Plausible reason for gold-digging ant
What's the oldest plausible frozen specimen for a Jurassic Park style story-line?
Concatenating two int[]
Converting very wide logos to square formats
What does an unprocessed RAW file look like?
Modern Algebraic Geometry and Analytic Number Theory
Is it really OK to use "because of"?
Caron Accent v{a} doesn't render without usepackage{xeCJK}
The number of ways of choosing with parameters
Different ways of coloring a $4 times 4$ game boardWhat does the “n choose multiple numbers” symbol stands for?Recurrence Relation, Discrete Math problem(Homework)Condition over CombinationsWith how many different ways can Adriana be dressed…????Counting the number of trials.In how many ways we can color $15$ eggs..In how many ways can two different colored balls be chosen?Combinatorics: Coloring a prismProbability of picking two marbles each from two colors when selecting $4$ marbles out of $30$ marbles
$begingroup$
At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?
My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.
My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!
combinatorics discrete-mathematics
New contributor
$endgroup$
add a comment |
$begingroup$
At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?
My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.
My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!
combinatorics discrete-mathematics
New contributor
$endgroup$
add a comment |
$begingroup$
At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?
My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.
My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!
combinatorics discrete-mathematics
New contributor
$endgroup$
At our disposal is a collection of $10$ red, $11$ blue and $12$ yellow fabrics. (each fabric is unique) In how many ways can we choose $4$ different fabrics if we want at least one fabric of each of the three colors?
My solution was since the first fabric chosen must be red, there are $10$ options for it. Then the next fabric must be blue, which has $11$ options. The third fabric is yellow, with $12$ options, and the last fabric can be any of the colors, provided that it has not already been chosen, so there are $(9+10+11-3)= 30$ ways to choose the last one, making the total number of choices $9cdot 10cdot 11cdot 30$.
My professor said that I needed to divide that by $2$ to get the right answer, but I just don't understand why. Any help would be much appreciated!
combinatorics discrete-mathematics
combinatorics discrete-mathematics
New contributor
New contributor
edited 1 hour ago
Vinyl_coat_jawa
3,0101132
3,0101132
New contributor
asked 10 hours ago
cmplxlizcmplxliz
211
211
New contributor
New contributor
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Because under your scheme you would count, for example, both
$$R1,B1,Y1,R2quadhbox{and}quad R2,B1,Y1,R1 .$$
But these are actually the same choice and therefore should not be counted twice.
$endgroup$
add a comment |
$begingroup$
The total number of ways is $binom {10} {2} binom {11} {1} binom {12} {1} + binom {10} {1} binom {11} {2} binom {12} {1} + binom {10} {1} binom {11} {1} binom {12} {2} = 19800.$
$endgroup$
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
});
}
});
cmplxliz is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3125635%2fthe-number-of-ways-of-choosing-with-parameters%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Because under your scheme you would count, for example, both
$$R1,B1,Y1,R2quadhbox{and}quad R2,B1,Y1,R1 .$$
But these are actually the same choice and therefore should not be counted twice.
$endgroup$
add a comment |
$begingroup$
Because under your scheme you would count, for example, both
$$R1,B1,Y1,R2quadhbox{and}quad R2,B1,Y1,R1 .$$
But these are actually the same choice and therefore should not be counted twice.
$endgroup$
add a comment |
$begingroup$
Because under your scheme you would count, for example, both
$$R1,B1,Y1,R2quadhbox{and}quad R2,B1,Y1,R1 .$$
But these are actually the same choice and therefore should not be counted twice.
$endgroup$
Because under your scheme you would count, for example, both
$$R1,B1,Y1,R2quadhbox{and}quad R2,B1,Y1,R1 .$$
But these are actually the same choice and therefore should not be counted twice.
answered 10 hours ago
DavidDavid
69.2k667130
69.2k667130
add a comment |
add a comment |
$begingroup$
The total number of ways is $binom {10} {2} binom {11} {1} binom {12} {1} + binom {10} {1} binom {11} {2} binom {12} {1} + binom {10} {1} binom {11} {1} binom {12} {2} = 19800.$
$endgroup$
add a comment |
$begingroup$
The total number of ways is $binom {10} {2} binom {11} {1} binom {12} {1} + binom {10} {1} binom {11} {2} binom {12} {1} + binom {10} {1} binom {11} {1} binom {12} {2} = 19800.$
$endgroup$
add a comment |
$begingroup$
The total number of ways is $binom {10} {2} binom {11} {1} binom {12} {1} + binom {10} {1} binom {11} {2} binom {12} {1} + binom {10} {1} binom {11} {1} binom {12} {2} = 19800.$
$endgroup$
The total number of ways is $binom {10} {2} binom {11} {1} binom {12} {1} + binom {10} {1} binom {11} {2} binom {12} {1} + binom {10} {1} binom {11} {1} binom {12} {2} = 19800.$
answered 10 hours ago
Dbchatto67Dbchatto67
1,142118
1,142118
add a comment |
add a comment |
cmplxliz is a new contributor. Be nice, and check out our Code of Conduct.
cmplxliz is a new contributor. Be nice, and check out our Code of Conduct.
cmplxliz is a new contributor. Be nice, and check out our Code of Conduct.
cmplxliz is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3125635%2fthe-number-of-ways-of-choosing-with-parameters%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