The number of ways of choosing with parametersDifferent ways of coloring a $4 times 4$ game boardWhat does...
Why is Shelob considered evil?
Boss asked me to sign a resignation paper without a date on it along with my new contract
Taking an academic pseudonym?
Website seeing my Facebook data?
Allow console draw poker game to output more hands
How to completely remove a package in Ubuntu (like it never existed)
Case protection with emphasis in biblatex
How can I give a Ranger advantage on a check due to Favored Enemy without spoiling the story for the player?
Work done in the presence of gravity
Illustrator to chemdraw
What is an efficient way to digitize a family photo collection?
Is it possible to rotate the Isolines on a Surface Using `MeshFunction`?
Single-row INSERT...SELECT much slower than separate SELECT
How vim overwrites readonly mode?
I have trouble understanding this fallacy: "If A, then B. Therefore if not-B, then not-A."
Can a player sacrifice a creature after declaring that creature as blocker while taking lethal damage?
Is there a non trivial covering of the Klein bottle by the Klein bottle
To be or not to be - Optional arguments inside definition of macro
How to not let the Identify spell spoil everything?
Is there a file that always exists and a 'normal' user can't lstat it?
Prevent Nautilus / Nemo from creating .Trash-1000 folder in mounted devices
Other than edits for international editions, did Harry Potter and the Philosopher's Stone receive errata?
Co-worker sabotaging/undoing my work (software development)
Icon at Subject-line scrlttr2
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
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
edited 8 mins ago
Vinyl_coat_jawa
3,0001132
3,0001132
asked 9 hours ago
cmplxlizcmplxliz
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 hours ago
cmplxlizcmplxliz
211
asked 9 hours ago
cmplxlizcmplxliz
211
211
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
cmplxliz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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.
answered 8 hours ago
DavidDavid
69.2k667130
$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.$
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
$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.
answered 8 hours ago
DavidDavid
69.2k667130
$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.
answered 8 hours ago
DavidDavid
69.2k667130
$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.
answered 8 hours ago
DavidDavid
69.2k667130
$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 8 hours ago
DavidDavid
69.2k667130
answered 8 hours ago
DavidDavid
69.2k667130
answered 8 hours ago
DavidDavid
69.2k667130
answered 8 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.$
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
$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.$
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
$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.$
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
$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 8 hours ago
Dbchatto67Dbchatto67
1,142118
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
answered 8 hours ago
Dbchatto67Dbchatto67
1,142118
answered 8 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
