multichoose but limit the duplicates












1












$begingroup$


"n choose k" is how many combinations of: k-sized elements from n unique choices.



"n multichoose k" is how many k-sized elements from n choices, where full multiplicity is allowed (that is, {a, b, c} choose 3 can have {a, a, a}).



How do we calculate "n choose k by m" where we allow only m duplicates?










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you mean by $n$ choose $k$ by $m$?
    $endgroup$
    – Prakhar Nagpal
    Dec 21 '18 at 4:23
















1












$begingroup$


"n choose k" is how many combinations of: k-sized elements from n unique choices.



"n multichoose k" is how many k-sized elements from n choices, where full multiplicity is allowed (that is, {a, b, c} choose 3 can have {a, a, a}).



How do we calculate "n choose k by m" where we allow only m duplicates?










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you mean by $n$ choose $k$ by $m$?
    $endgroup$
    – Prakhar Nagpal
    Dec 21 '18 at 4:23














1












1








1





$begingroup$


"n choose k" is how many combinations of: k-sized elements from n unique choices.



"n multichoose k" is how many k-sized elements from n choices, where full multiplicity is allowed (that is, {a, b, c} choose 3 can have {a, a, a}).



How do we calculate "n choose k by m" where we allow only m duplicates?










share|cite|improve this question









$endgroup$




"n choose k" is how many combinations of: k-sized elements from n unique choices.



"n multichoose k" is how many k-sized elements from n choices, where full multiplicity is allowed (that is, {a, b, c} choose 3 can have {a, a, a}).



How do we calculate "n choose k by m" where we allow only m duplicates?







combinatorics






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 21 '18 at 2:06









pixelspixels

1085




1085












  • $begingroup$
    What do you mean by $n$ choose $k$ by $m$?
    $endgroup$
    – Prakhar Nagpal
    Dec 21 '18 at 4:23


















  • $begingroup$
    What do you mean by $n$ choose $k$ by $m$?
    $endgroup$
    – Prakhar Nagpal
    Dec 21 '18 at 4:23
















$begingroup$
What do you mean by $n$ choose $k$ by $m$?
$endgroup$
– Prakhar Nagpal
Dec 21 '18 at 4:23




$begingroup$
What do you mean by $n$ choose $k$ by $m$?
$endgroup$
– Prakhar Nagpal
Dec 21 '18 at 4:23










0






active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048116%2fmultichoose-but-limit-the-duplicates%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048116%2fmultichoose-but-limit-the-duplicates%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Bundesstraße 106

Verónica Boquete

Ida-Boy-Ed-Garten