Discrete math counting principles
$begingroup$
In how many ways can a teacher distribute 12 identical science books among 15 students if
1) no student gets more than one book?
2) if the oldest student gets two books but no other student gets more than one book?
Initially, I tried the binomial theorems with the idea that the student gets a book or no book but that is not giving me the correct solution.
combinatorics permutations combinations
$endgroup$
add a comment |
$begingroup$
In how many ways can a teacher distribute 12 identical science books among 15 students if
1) no student gets more than one book?
2) if the oldest student gets two books but no other student gets more than one book?
Initially, I tried the binomial theorems with the idea that the student gets a book or no book but that is not giving me the correct solution.
combinatorics permutations combinations
$endgroup$
add a comment |
$begingroup$
In how many ways can a teacher distribute 12 identical science books among 15 students if
1) no student gets more than one book?
2) if the oldest student gets two books but no other student gets more than one book?
Initially, I tried the binomial theorems with the idea that the student gets a book or no book but that is not giving me the correct solution.
combinatorics permutations combinations
$endgroup$
In how many ways can a teacher distribute 12 identical science books among 15 students if
1) no student gets more than one book?
2) if the oldest student gets two books but no other student gets more than one book?
Initially, I tried the binomial theorems with the idea that the student gets a book or no book but that is not giving me the correct solution.
combinatorics permutations combinations
combinatorics permutations combinations
edited Dec 9 '18 at 19:44
Robert Z
97.4k1066137
97.4k1066137
asked Dec 9 '18 at 19:38
critter1854critter1854
1
1
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Hint for 1) Count the number of subsets of cardinality $12$ of a set of $15$ elements.
Hint for 2) Count the number of subsets of cardinality $12-2$ of a set of $15-1$ elements.
$endgroup$
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
add a comment |
$begingroup$
Assuming the students are distinguishable:
For the first one: If no student gets more than one book, then it is just a matter of finding the number of ways to pick 12 students out of those 15, i.e. $15 choose 12$
For the second one: the oldest one gets 2 books ... leaving 14 students ... and 10 books ... can you do the rest?
$endgroup$
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
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%2f3032858%2fdiscrete-math-counting-principles%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$
Hint for 1) Count the number of subsets of cardinality $12$ of a set of $15$ elements.
Hint for 2) Count the number of subsets of cardinality $12-2$ of a set of $15-1$ elements.
$endgroup$
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
add a comment |
$begingroup$
Hint for 1) Count the number of subsets of cardinality $12$ of a set of $15$ elements.
Hint for 2) Count the number of subsets of cardinality $12-2$ of a set of $15-1$ elements.
$endgroup$
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
add a comment |
$begingroup$
Hint for 1) Count the number of subsets of cardinality $12$ of a set of $15$ elements.
Hint for 2) Count the number of subsets of cardinality $12-2$ of a set of $15-1$ elements.
$endgroup$
Hint for 1) Count the number of subsets of cardinality $12$ of a set of $15$ elements.
Hint for 2) Count the number of subsets of cardinality $12-2$ of a set of $15-1$ elements.
answered Dec 9 '18 at 19:47
Robert ZRobert Z
97.4k1066137
97.4k1066137
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
add a comment |
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
$begingroup$
The books are identical!
$endgroup$
– Robert Z
Dec 9 '18 at 20:39
add a comment |
$begingroup$
Assuming the students are distinguishable:
For the first one: If no student gets more than one book, then it is just a matter of finding the number of ways to pick 12 students out of those 15, i.e. $15 choose 12$
For the second one: the oldest one gets 2 books ... leaving 14 students ... and 10 books ... can you do the rest?
$endgroup$
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
add a comment |
$begingroup$
Assuming the students are distinguishable:
For the first one: If no student gets more than one book, then it is just a matter of finding the number of ways to pick 12 students out of those 15, i.e. $15 choose 12$
For the second one: the oldest one gets 2 books ... leaving 14 students ... and 10 books ... can you do the rest?
$endgroup$
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
add a comment |
$begingroup$
Assuming the students are distinguishable:
For the first one: If no student gets more than one book, then it is just a matter of finding the number of ways to pick 12 students out of those 15, i.e. $15 choose 12$
For the second one: the oldest one gets 2 books ... leaving 14 students ... and 10 books ... can you do the rest?
$endgroup$
Assuming the students are distinguishable:
For the first one: If no student gets more than one book, then it is just a matter of finding the number of ways to pick 12 students out of those 15, i.e. $15 choose 12$
For the second one: the oldest one gets 2 books ... leaving 14 students ... and 10 books ... can you do the rest?
edited Dec 9 '18 at 19:50
answered Dec 9 '18 at 19:45
Bram28Bram28
62.4k44793
62.4k44793
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
add a comment |
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
This is an exam prep so I don't have the actual answers, so I just want to make sure I am correct in my thinking. So the first is 15c12 = 455 and the second is 14c10 =1001
$endgroup$
– critter1854
Dec 9 '18 at 19:58
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@critter1854 Yes, correct!
$endgroup$
– Bram28
Dec 9 '18 at 20:07
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
$begingroup$
@N.F.Taussig But the books are identical ...
$endgroup$
– Bram28
Dec 9 '18 at 20:31
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%2f3032858%2fdiscrete-math-counting-principles%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