How to find a number of solutions for $x_1+x_2+ldots+x_n=r$ where $r$ is divisible by 3 and for a given $l$...












0












$begingroup$



How to find a number of solutions for $x_1+x_2+ldots+x_n=r$ where $r$ is divisible by 3 and for a given $l$ and $r$ such that $lleq x_i leq r$?











share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    what is this have to do with Taylor expansion?
    $endgroup$
    – pointguard0
    Jan 20 at 14:02






  • 2




    $begingroup$
    Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
    $endgroup$
    – lulu
    Jan 20 at 14:10










  • $begingroup$
    Or maybe using generating functions, similar to this.
    $endgroup$
    – rtybase
    Jan 21 at 12:52
















0












$begingroup$



How to find a number of solutions for $x_1+x_2+ldots+x_n=r$ where $r$ is divisible by 3 and for a given $l$ and $r$ such that $lleq x_i leq r$?











share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    what is this have to do with Taylor expansion?
    $endgroup$
    – pointguard0
    Jan 20 at 14:02






  • 2




    $begingroup$
    Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
    $endgroup$
    – lulu
    Jan 20 at 14:10










  • $begingroup$
    Or maybe using generating functions, similar to this.
    $endgroup$
    – rtybase
    Jan 21 at 12:52














0












0








0


2



$begingroup$



How to find a number of solutions for $x_1+x_2+ldots+x_n=r$ where $r$ is divisible by 3 and for a given $l$ and $r$ such that $lleq x_i leq r$?











share|cite|improve this question











$endgroup$





How to find a number of solutions for $x_1+x_2+ldots+x_n=r$ where $r$ is divisible by 3 and for a given $l$ and $r$ such that $lleq x_i leq r$?








combinatorics combinations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 21 at 11:17









N. F. Taussig

44.3k93357




44.3k93357










asked Jan 20 at 13:58









Sail AkhilSail Akhil

205




205








  • 1




    $begingroup$
    what is this have to do with Taylor expansion?
    $endgroup$
    – pointguard0
    Jan 20 at 14:02






  • 2




    $begingroup$
    Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
    $endgroup$
    – lulu
    Jan 20 at 14:10










  • $begingroup$
    Or maybe using generating functions, similar to this.
    $endgroup$
    – rtybase
    Jan 21 at 12:52














  • 1




    $begingroup$
    what is this have to do with Taylor expansion?
    $endgroup$
    – pointguard0
    Jan 20 at 14:02






  • 2




    $begingroup$
    Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
    $endgroup$
    – lulu
    Jan 20 at 14:10










  • $begingroup$
    Or maybe using generating functions, similar to this.
    $endgroup$
    – rtybase
    Jan 21 at 12:52








1




1




$begingroup$
what is this have to do with Taylor expansion?
$endgroup$
– pointguard0
Jan 20 at 14:02




$begingroup$
what is this have to do with Taylor expansion?
$endgroup$
– pointguard0
Jan 20 at 14:02




2




2




$begingroup$
Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
$endgroup$
– lulu
Jan 20 at 14:10




$begingroup$
Letting $y_i=x_i-l$ this becomes a routine Stars and Bars problem. $r$ can be whatever you want...divisibility by $3$ doesn't change the computation.
$endgroup$
– lulu
Jan 20 at 14:10












$begingroup$
Or maybe using generating functions, similar to this.
$endgroup$
– rtybase
Jan 21 at 12:52




$begingroup$
Or maybe using generating functions, similar to this.
$endgroup$
– rtybase
Jan 21 at 12:52










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%2f3080612%2fhow-to-find-a-number-of-solutions-for-x-1x-2-ldotsx-n-r-where-r-is-divisi%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%2f3080612%2fhow-to-find-a-number-of-solutions-for-x-1x-2-ldotsx-n-r-where-r-is-divisi%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

Mario Kart Wii

Understanding the size os this class of aleatory events

Partial Derivative Guidance.