Binomial coefficient formula reduction












0












$begingroup$


I think I need to use $(x+y)^n = sum_{k=0}^n {n choose k} x^{n-k} y^k$, but I can't figure out how. I am trying to see why



$$frac{y!}{x!(y-x)!} lambda^x mu^{y-x} / sum_{x,r:x+r=y}frac{y!}{x! r!} lambda^x mu^r$$



is the same as



$${y choose x} left(frac{lambda}{lambda + mu} right)^x left( frac{mu}{lambda + mu} right)^{y-x}$$



But can't see why






statistics binomial-coefficients







share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I think I need to use $(x+y)^n = sum_{k=0}^n {n choose k} x^{n-k} y^k$, but I can't figure out how. I am trying to see why



    $$frac{y!}{x!(y-x)!} lambda^x mu^{y-x} / sum_{x,r:x+r=y}frac{y!}{x! r!} lambda^x mu^r$$



    is the same as



    $${y choose x} left(frac{lambda}{lambda + mu} right)^x left( frac{mu}{lambda + mu} right)^{y-x}$$



    But can't see why






    statistics binomial-coefficients







    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I think I need to use $(x+y)^n = sum_{k=0}^n {n choose k} x^{n-k} y^k$, but I can't figure out how. I am trying to see why



      $$frac{y!}{x!(y-x)!} lambda^x mu^{y-x} / sum_{x,r:x+r=y}frac{y!}{x! r!} lambda^x mu^r$$



      is the same as



      $${y choose x} left(frac{lambda}{lambda + mu} right)^x left( frac{mu}{lambda + mu} right)^{y-x}$$



      But can't see why






      statistics binomial-coefficients







      share|cite|improve this question









      $endgroup$




      I think I need to use $(x+y)^n = sum_{k=0}^n {n choose k} x^{n-k} y^k$, but I can't figure out how. I am trying to see why



      $$frac{y!}{x!(y-x)!} lambda^x mu^{y-x} / sum_{x,r:x+r=y}frac{y!}{x! r!} lambda^x mu^r$$



      is the same as



      $${y choose x} left(frac{lambda}{lambda + mu} right)^x left( frac{mu}{lambda + mu} right)^{y-x}$$



      But can't see why






      statistics binomial-coefficients




      statistics binomial-coefficients






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 8 at 21:57









      i squared - Keep it Reali squared - Keep it Real

      1,62511127




      1,62511127






















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$

          The numerator of your LHS is by definition of ${n choose k}$ equal to $${y choose x} lambda^x mu^{y-x}$$
          The denominator can be rewritten as:
          $$sum_{r=0}^y {y choose r} mu^r lambda^{y-r} = (mu+lambda)^y = (mu+lambda)^x (mu+lambda)^{y-x}$$



          Now if you take a ratio of the simplified numerator and denominator, you will get the desired answer,






          share|cite|improve this answer









          $endgroup$





















            1












            $begingroup$

            It seems that the index r starts at $r=0$ and the maximum value of r is if $x=0$. That means $r=y-x=y-0=y$.



            $$sum_{r=0}^yfrac{y!}{x! r!} lambda^x mu^r overset{substitution}{=}sum_{r=0}^yfrac{y!}{(y-r)! r!}lambda^{y-r} mu^r$$



            Now apply the binomial theorem.






            share|cite|improve this answer











            $endgroup$





















              0












              $begingroup$

              If you match the two expressions and cancel terms, you find that you need to show
              $$(lambda + mu)^y = sum_{x,r : x+r = y} frac{y!}{x! r!} lambda^x mu^r.$$






              share|cite|improve this answer









              $endgroup$













              • $begingroup$
                how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                $endgroup$
                – i squared - Keep it Real
                Jan 8 at 22:26












              • $begingroup$
                which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                $endgroup$
                – i squared - Keep it Real
                Jan 8 at 22:27










              • $begingroup$
                which is $(lambda + mu)^y$...
                $endgroup$
                – i squared - Keep it Real
                Jan 8 at 22:28










              • $begingroup$
                can't show it..
                $endgroup$
                – i squared - Keep it Real
                Jan 8 at 22:37










              • $begingroup$
                it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                $endgroup$
                – i squared - Keep it Real
                Jan 8 at 22:42












              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%2f3066777%2fbinomial-coefficient-formula-reduction%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$

              The numerator of your LHS is by definition of ${n choose k}$ equal to $${y choose x} lambda^x mu^{y-x}$$
              The denominator can be rewritten as:
              $$sum_{r=0}^y {y choose r} mu^r lambda^{y-r} = (mu+lambda)^y = (mu+lambda)^x (mu+lambda)^{y-x}$$



              Now if you take a ratio of the simplified numerator and denominator, you will get the desired answer,






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                The numerator of your LHS is by definition of ${n choose k}$ equal to $${y choose x} lambda^x mu^{y-x}$$
                The denominator can be rewritten as:
                $$sum_{r=0}^y {y choose r} mu^r lambda^{y-r} = (mu+lambda)^y = (mu+lambda)^x (mu+lambda)^{y-x}$$



                Now if you take a ratio of the simplified numerator and denominator, you will get the desired answer,






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  The numerator of your LHS is by definition of ${n choose k}$ equal to $${y choose x} lambda^x mu^{y-x}$$
                  The denominator can be rewritten as:
                  $$sum_{r=0}^y {y choose r} mu^r lambda^{y-r} = (mu+lambda)^y = (mu+lambda)^x (mu+lambda)^{y-x}$$



                  Now if you take a ratio of the simplified numerator and denominator, you will get the desired answer,






                  share|cite|improve this answer









                  $endgroup$



                  The numerator of your LHS is by definition of ${n choose k}$ equal to $${y choose x} lambda^x mu^{y-x}$$
                  The denominator can be rewritten as:
                  $$sum_{r=0}^y {y choose r} mu^r lambda^{y-r} = (mu+lambda)^y = (mu+lambda)^x (mu+lambda)^{y-x}$$



                  Now if you take a ratio of the simplified numerator and denominator, you will get the desired answer,







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 8 at 23:33









                  Aditya DuaAditya Dua

                  1,15418




                  1,15418























                      1












                      $begingroup$

                      It seems that the index r starts at $r=0$ and the maximum value of r is if $x=0$. That means $r=y-x=y-0=y$.



                      $$sum_{r=0}^yfrac{y!}{x! r!} lambda^x mu^r overset{substitution}{=}sum_{r=0}^yfrac{y!}{(y-r)! r!}lambda^{y-r} mu^r$$



                      Now apply the binomial theorem.






                      share|cite|improve this answer











                      $endgroup$


















                        1












                        $begingroup$

                        It seems that the index r starts at $r=0$ and the maximum value of r is if $x=0$. That means $r=y-x=y-0=y$.



                        $$sum_{r=0}^yfrac{y!}{x! r!} lambda^x mu^r overset{substitution}{=}sum_{r=0}^yfrac{y!}{(y-r)! r!}lambda^{y-r} mu^r$$



                        Now apply the binomial theorem.






                        share|cite|improve this answer











                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          It seems that the index r starts at $r=0$ and the maximum value of r is if $x=0$. That means $r=y-x=y-0=y$.



                          $$sum_{r=0}^yfrac{y!}{x! r!} lambda^x mu^r overset{substitution}{=}sum_{r=0}^yfrac{y!}{(y-r)! r!}lambda^{y-r} mu^r$$



                          Now apply the binomial theorem.






                          share|cite|improve this answer











                          $endgroup$



                          It seems that the index r starts at $r=0$ and the maximum value of r is if $x=0$. That means $r=y-x=y-0=y$.



                          $$sum_{r=0}^yfrac{y!}{x! r!} lambda^x mu^r overset{substitution}{=}sum_{r=0}^yfrac{y!}{(y-r)! r!}lambda^{y-r} mu^r$$



                          Now apply the binomial theorem.







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited Jan 8 at 23:43

























                          answered Jan 8 at 23:34









                          callculuscallculus

                          18.7k31428




                          18.7k31428























                              0












                              $begingroup$

                              If you match the two expressions and cancel terms, you find that you need to show
                              $$(lambda + mu)^y = sum_{x,r : x+r = y} frac{y!}{x! r!} lambda^x mu^r.$$






                              share|cite|improve this answer









                              $endgroup$













                              • $begingroup$
                                how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:26












                              • $begingroup$
                                which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:27










                              • $begingroup$
                                which is $(lambda + mu)^y$...
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:28










                              • $begingroup$
                                can't show it..
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:37










                              • $begingroup$
                                it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:42
















                              0












                              $begingroup$

                              If you match the two expressions and cancel terms, you find that you need to show
                              $$(lambda + mu)^y = sum_{x,r : x+r = y} frac{y!}{x! r!} lambda^x mu^r.$$






                              share|cite|improve this answer









                              $endgroup$













                              • $begingroup$
                                how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:26












                              • $begingroup$
                                which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:27










                              • $begingroup$
                                which is $(lambda + mu)^y$...
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:28










                              • $begingroup$
                                can't show it..
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:37










                              • $begingroup$
                                it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:42














                              0












                              0








                              0





                              $begingroup$

                              If you match the two expressions and cancel terms, you find that you need to show
                              $$(lambda + mu)^y = sum_{x,r : x+r = y} frac{y!}{x! r!} lambda^x mu^r.$$






                              share|cite|improve this answer









                              $endgroup$



                              If you match the two expressions and cancel terms, you find that you need to show
                              $$(lambda + mu)^y = sum_{x,r : x+r = y} frac{y!}{x! r!} lambda^x mu^r.$$







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered Jan 8 at 22:00









                              angryavianangryavian

                              42.5k23481




                              42.5k23481












                              • $begingroup$
                                how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:26












                              • $begingroup$
                                which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:27










                              • $begingroup$
                                which is $(lambda + mu)^y$...
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:28










                              • $begingroup$
                                can't show it..
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:37










                              • $begingroup$
                                it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:42


















                              • $begingroup$
                                how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:26












                              • $begingroup$
                                which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:27










                              • $begingroup$
                                which is $(lambda + mu)^y$...
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:28










                              • $begingroup$
                                can't show it..
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:37










                              • $begingroup$
                                it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                                $endgroup$
                                – i squared - Keep it Real
                                Jan 8 at 22:42
















                              $begingroup$
                              how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:26






                              $begingroup$
                              how so, if in the second expression, the two denominators are: $(lambda + mu)^x$ and $(lambda + mu)^{y-x}$
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:26














                              $begingroup$
                              which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:27




                              $begingroup$
                              which would mean that $(lambda + mu)^x(lambda + mu)^{y-x} = sum_{x,r:x+r=y} frac{y!}{x!r!}lambda^x mu^r$
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:27












                              $begingroup$
                              which is $(lambda + mu)^y$...
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:28




                              $begingroup$
                              which is $(lambda + mu)^y$...
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:28












                              $begingroup$
                              can't show it..
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:37




                              $begingroup$
                              can't show it..
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:37












                              $begingroup$
                              it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:42




                              $begingroup$
                              it is intuitive that that is the result because we are finding all the combinations that sum up to $y$. The crux must be in re-writing the $x,r:x+r=y$ intelligently
                              $endgroup$
                              – i squared - Keep it Real
                              Jan 8 at 22:42


















                              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%2f3066777%2fbinomial-coefficient-formula-reduction%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

                              Bressuire

                              Image
                              .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
                              Read more

                              Cabo Verde

                              Image
                                Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º)
                              Read more

                              Gyllenstierna

                              Image
                              .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
                              Read more