How to find the value of $r$ such that $frac1binom9r - frac1binom10r = frac116binom11r$?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
3
down vote

favorite












Find the value of $r$:



$$frac1dbinom9r - frac1dbinom10r = frac116dbinom11r$$



I'm not sure where I should take this problem in order to isolate $r$. I seem to get many factorials that don't seem to combine.










share|cite|improve this question























  • Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
    – N. F. Taussig
    Sep 25 at 0:56














up vote
3
down vote

favorite












Find the value of $r$:



$$frac1dbinom9r - frac1dbinom10r = frac116dbinom11r$$



I'm not sure where I should take this problem in order to isolate $r$. I seem to get many factorials that don't seem to combine.










share|cite|improve this question























  • Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
    – N. F. Taussig
    Sep 25 at 0:56












up vote
3
down vote

favorite









up vote
3
down vote

favorite











Find the value of $r$:



$$frac1dbinom9r - frac1dbinom10r = frac116dbinom11r$$



I'm not sure where I should take this problem in order to isolate $r$. I seem to get many factorials that don't seem to combine.










share|cite|improve this question















Find the value of $r$:



$$frac1dbinom9r - frac1dbinom10r = frac116dbinom11r$$



I'm not sure where I should take this problem in order to isolate $r$. I seem to get many factorials that don't seem to combine.







combinatorics binomial-coefficients






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 25 at 10:14









N. F. Taussig

40.5k93253




40.5k93253










asked Sep 25 at 0:26









Nick R

161




161











  • Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
    – N. F. Taussig
    Sep 25 at 0:56
















  • Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
    – N. F. Taussig
    Sep 25 at 0:56















Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
– N. F. Taussig
Sep 25 at 0:56




Welcome to MathSE. Please read this tutorial on how to typeset mathematics on this site. When you pose a question here, you should show what you have attempted in addition to explaining where you got stuck. That helps users identify any mistakes you may have made and write answers appropriate to your skill level.
– N. F. Taussig
Sep 25 at 0:56










3 Answers
3






active

oldest

votes

















up vote
6
down vote













Since
$$binomnk =
begincases
dfracn!k!(n - k)! & textif $0 leq k leq n$\[2 mm]
0 & textif $k > n$
endcases$$

we require that $k leq 9$ since otherwise we would be dividing by $0$.



beginalign*
frac1binom9k - frac1binom10k & = frac116binom11k\
frac1dfrac9!k!(9 - k)! - frac1dfrac10!k!(10 - k)! & = frac116 cdot dfrac11!k!(11 - k)! && textby definition of $binomnk$\
frack!(9 - k)!9! - frack!(10 - k)!10! & = frac11k!(11 - k)!6 cdot 11! && textdivision is multiplication by the reciprocal\
frac10k!(9 - k)!10! - frack!(10 - k)!10! & = frack!(11 - k)!6 cdot 10! && textform common denominator on LHS, cancel on RHS\
6[10k!(9 - k)! - k!(10 - k)!] & = k!(11 - k)! && textmultiply by $6 cdot 10!$\
6[10 - (10 - k)] & = (11 - k)(10 - k) && textdivide by $k!(9 - k)!$\
6k & = 110 - 21k + k^2 && textsimplify\
0 & = k^2 - 27k + 110 && textset quadratic equal to zero
endalign*

When you solve the quadratic equation, keep in mind the restriction that $k leq 9$.






share|cite|improve this answer



























    up vote
    3
    down vote













    Hopefully you know the formula $dbinomnk = fracn!(n-k)!k!$.



    So your equation becomes:
    $$fracr!(9-r)!9! - fracr!(10-r)!10! = frac11times r!(11-r)!6times 11!$$



    $$fracr!(9-r)!9! - fracr!(9-r)!(10-r)9!times 10 = frac11times r!(9-r)!(10-r)(11-r)6times 9!times10times11$$



    Divide both sides by $fracr!(9-r)!9!$:



    $$1-frac10-r10 = frac11times (10-r)(11-r)6times 10times11$$



    I hope it's now clear that this is a quadratic equation. I haven't tried to solve it, but the work should be simple.



    EDIT: I totally forgot about the restriction. Taussig's answer is correct, after solving the quadratic equation you must eliminate any r>9.






    share|cite|improve this answer





























      up vote
      0
      down vote













      Making the problem more general
      $$frac1dbinomnr - frac1dbinomn+1r = frackdbinomn+2r$$ and using the same approach as N. F. Taussig in his/her answer, you should end with a quadratic equation in $r$
      $$k r^2- left(k(2 n+3 )+n+2right)r+kleft( n^2+3 n+2right)=0$$ If $k >0$, there are two positive roots $left(Delta=k^2+2 k (n+2) (2 n+3)+(n+2)^2,r_1+r_2>0,r_1r_2>0right)$ and, as said in answers, you must discard the one which is > n.






      share|cite|improve this answer






















        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',
        convertImagesToLinks: true,
        noModals: false,
        showLowRepImageUploadWarning: true,
        reputationToPostImages: 10,
        bindNavPrevention: true,
        postfix: "",
        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%2f2929538%2fhow-to-find-the-value-of-r-such-that-frac1-binom9r-frac1-binom%23new-answer', 'question_page');

        );

        Post as a guest






























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes








        up vote
        6
        down vote













        Since
        $$binomnk =
        begincases
        dfracn!k!(n - k)! & textif $0 leq k leq n$\[2 mm]
        0 & textif $k > n$
        endcases$$

        we require that $k leq 9$ since otherwise we would be dividing by $0$.



        beginalign*
        frac1binom9k - frac1binom10k & = frac116binom11k\
        frac1dfrac9!k!(9 - k)! - frac1dfrac10!k!(10 - k)! & = frac116 cdot dfrac11!k!(11 - k)! && textby definition of $binomnk$\
        frack!(9 - k)!9! - frack!(10 - k)!10! & = frac11k!(11 - k)!6 cdot 11! && textdivision is multiplication by the reciprocal\
        frac10k!(9 - k)!10! - frack!(10 - k)!10! & = frack!(11 - k)!6 cdot 10! && textform common denominator on LHS, cancel on RHS\
        6[10k!(9 - k)! - k!(10 - k)!] & = k!(11 - k)! && textmultiply by $6 cdot 10!$\
        6[10 - (10 - k)] & = (11 - k)(10 - k) && textdivide by $k!(9 - k)!$\
        6k & = 110 - 21k + k^2 && textsimplify\
        0 & = k^2 - 27k + 110 && textset quadratic equal to zero
        endalign*

        When you solve the quadratic equation, keep in mind the restriction that $k leq 9$.






        share|cite|improve this answer
























          up vote
          6
          down vote













          Since
          $$binomnk =
          begincases
          dfracn!k!(n - k)! & textif $0 leq k leq n$\[2 mm]
          0 & textif $k > n$
          endcases$$

          we require that $k leq 9$ since otherwise we would be dividing by $0$.



          beginalign*
          frac1binom9k - frac1binom10k & = frac116binom11k\
          frac1dfrac9!k!(9 - k)! - frac1dfrac10!k!(10 - k)! & = frac116 cdot dfrac11!k!(11 - k)! && textby definition of $binomnk$\
          frack!(9 - k)!9! - frack!(10 - k)!10! & = frac11k!(11 - k)!6 cdot 11! && textdivision is multiplication by the reciprocal\
          frac10k!(9 - k)!10! - frack!(10 - k)!10! & = frack!(11 - k)!6 cdot 10! && textform common denominator on LHS, cancel on RHS\
          6[10k!(9 - k)! - k!(10 - k)!] & = k!(11 - k)! && textmultiply by $6 cdot 10!$\
          6[10 - (10 - k)] & = (11 - k)(10 - k) && textdivide by $k!(9 - k)!$\
          6k & = 110 - 21k + k^2 && textsimplify\
          0 & = k^2 - 27k + 110 && textset quadratic equal to zero
          endalign*

          When you solve the quadratic equation, keep in mind the restriction that $k leq 9$.






          share|cite|improve this answer






















            up vote
            6
            down vote










            up vote
            6
            down vote









            Since
            $$binomnk =
            begincases
            dfracn!k!(n - k)! & textif $0 leq k leq n$\[2 mm]
            0 & textif $k > n$
            endcases$$

            we require that $k leq 9$ since otherwise we would be dividing by $0$.



            beginalign*
            frac1binom9k - frac1binom10k & = frac116binom11k\
            frac1dfrac9!k!(9 - k)! - frac1dfrac10!k!(10 - k)! & = frac116 cdot dfrac11!k!(11 - k)! && textby definition of $binomnk$\
            frack!(9 - k)!9! - frack!(10 - k)!10! & = frac11k!(11 - k)!6 cdot 11! && textdivision is multiplication by the reciprocal\
            frac10k!(9 - k)!10! - frack!(10 - k)!10! & = frack!(11 - k)!6 cdot 10! && textform common denominator on LHS, cancel on RHS\
            6[10k!(9 - k)! - k!(10 - k)!] & = k!(11 - k)! && textmultiply by $6 cdot 10!$\
            6[10 - (10 - k)] & = (11 - k)(10 - k) && textdivide by $k!(9 - k)!$\
            6k & = 110 - 21k + k^2 && textsimplify\
            0 & = k^2 - 27k + 110 && textset quadratic equal to zero
            endalign*

            When you solve the quadratic equation, keep in mind the restriction that $k leq 9$.






            share|cite|improve this answer












            Since
            $$binomnk =
            begincases
            dfracn!k!(n - k)! & textif $0 leq k leq n$\[2 mm]
            0 & textif $k > n$
            endcases$$

            we require that $k leq 9$ since otherwise we would be dividing by $0$.



            beginalign*
            frac1binom9k - frac1binom10k & = frac116binom11k\
            frac1dfrac9!k!(9 - k)! - frac1dfrac10!k!(10 - k)! & = frac116 cdot dfrac11!k!(11 - k)! && textby definition of $binomnk$\
            frack!(9 - k)!9! - frack!(10 - k)!10! & = frac11k!(11 - k)!6 cdot 11! && textdivision is multiplication by the reciprocal\
            frac10k!(9 - k)!10! - frack!(10 - k)!10! & = frack!(11 - k)!6 cdot 10! && textform common denominator on LHS, cancel on RHS\
            6[10k!(9 - k)! - k!(10 - k)!] & = k!(11 - k)! && textmultiply by $6 cdot 10!$\
            6[10 - (10 - k)] & = (11 - k)(10 - k) && textdivide by $k!(9 - k)!$\
            6k & = 110 - 21k + k^2 && textsimplify\
            0 & = k^2 - 27k + 110 && textset quadratic equal to zero
            endalign*

            When you solve the quadratic equation, keep in mind the restriction that $k leq 9$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Sep 25 at 1:32









            N. F. Taussig

            40.5k93253




            40.5k93253




















                up vote
                3
                down vote













                Hopefully you know the formula $dbinomnk = fracn!(n-k)!k!$.



                So your equation becomes:
                $$fracr!(9-r)!9! - fracr!(10-r)!10! = frac11times r!(11-r)!6times 11!$$



                $$fracr!(9-r)!9! - fracr!(9-r)!(10-r)9!times 10 = frac11times r!(9-r)!(10-r)(11-r)6times 9!times10times11$$



                Divide both sides by $fracr!(9-r)!9!$:



                $$1-frac10-r10 = frac11times (10-r)(11-r)6times 10times11$$



                I hope it's now clear that this is a quadratic equation. I haven't tried to solve it, but the work should be simple.



                EDIT: I totally forgot about the restriction. Taussig's answer is correct, after solving the quadratic equation you must eliminate any r>9.






                share|cite|improve this answer


























                  up vote
                  3
                  down vote













                  Hopefully you know the formula $dbinomnk = fracn!(n-k)!k!$.



                  So your equation becomes:
                  $$fracr!(9-r)!9! - fracr!(10-r)!10! = frac11times r!(11-r)!6times 11!$$



                  $$fracr!(9-r)!9! - fracr!(9-r)!(10-r)9!times 10 = frac11times r!(9-r)!(10-r)(11-r)6times 9!times10times11$$



                  Divide both sides by $fracr!(9-r)!9!$:



                  $$1-frac10-r10 = frac11times (10-r)(11-r)6times 10times11$$



                  I hope it's now clear that this is a quadratic equation. I haven't tried to solve it, but the work should be simple.



                  EDIT: I totally forgot about the restriction. Taussig's answer is correct, after solving the quadratic equation you must eliminate any r>9.






                  share|cite|improve this answer
























                    up vote
                    3
                    down vote










                    up vote
                    3
                    down vote









                    Hopefully you know the formula $dbinomnk = fracn!(n-k)!k!$.



                    So your equation becomes:
                    $$fracr!(9-r)!9! - fracr!(10-r)!10! = frac11times r!(11-r)!6times 11!$$



                    $$fracr!(9-r)!9! - fracr!(9-r)!(10-r)9!times 10 = frac11times r!(9-r)!(10-r)(11-r)6times 9!times10times11$$



                    Divide both sides by $fracr!(9-r)!9!$:



                    $$1-frac10-r10 = frac11times (10-r)(11-r)6times 10times11$$



                    I hope it's now clear that this is a quadratic equation. I haven't tried to solve it, but the work should be simple.



                    EDIT: I totally forgot about the restriction. Taussig's answer is correct, after solving the quadratic equation you must eliminate any r>9.






                    share|cite|improve this answer














                    Hopefully you know the formula $dbinomnk = fracn!(n-k)!k!$.



                    So your equation becomes:
                    $$fracr!(9-r)!9! - fracr!(10-r)!10! = frac11times r!(11-r)!6times 11!$$



                    $$fracr!(9-r)!9! - fracr!(9-r)!(10-r)9!times 10 = frac11times r!(9-r)!(10-r)(11-r)6times 9!times10times11$$



                    Divide both sides by $fracr!(9-r)!9!$:



                    $$1-frac10-r10 = frac11times (10-r)(11-r)6times 10times11$$



                    I hope it's now clear that this is a quadratic equation. I haven't tried to solve it, but the work should be simple.



                    EDIT: I totally forgot about the restriction. Taussig's answer is correct, after solving the quadratic equation you must eliminate any r>9.







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited Sep 25 at 4:13

























                    answered Sep 25 at 0:51









                    Felix Fourcolor

                    320212




                    320212




















                        up vote
                        0
                        down vote













                        Making the problem more general
                        $$frac1dbinomnr - frac1dbinomn+1r = frackdbinomn+2r$$ and using the same approach as N. F. Taussig in his/her answer, you should end with a quadratic equation in $r$
                        $$k r^2- left(k(2 n+3 )+n+2right)r+kleft( n^2+3 n+2right)=0$$ If $k >0$, there are two positive roots $left(Delta=k^2+2 k (n+2) (2 n+3)+(n+2)^2,r_1+r_2>0,r_1r_2>0right)$ and, as said in answers, you must discard the one which is > n.






                        share|cite|improve this answer


























                          up vote
                          0
                          down vote













                          Making the problem more general
                          $$frac1dbinomnr - frac1dbinomn+1r = frackdbinomn+2r$$ and using the same approach as N. F. Taussig in his/her answer, you should end with a quadratic equation in $r$
                          $$k r^2- left(k(2 n+3 )+n+2right)r+kleft( n^2+3 n+2right)=0$$ If $k >0$, there are two positive roots $left(Delta=k^2+2 k (n+2) (2 n+3)+(n+2)^2,r_1+r_2>0,r_1r_2>0right)$ and, as said in answers, you must discard the one which is > n.






                          share|cite|improve this answer
























                            up vote
                            0
                            down vote










                            up vote
                            0
                            down vote









                            Making the problem more general
                            $$frac1dbinomnr - frac1dbinomn+1r = frackdbinomn+2r$$ and using the same approach as N. F. Taussig in his/her answer, you should end with a quadratic equation in $r$
                            $$k r^2- left(k(2 n+3 )+n+2right)r+kleft( n^2+3 n+2right)=0$$ If $k >0$, there are two positive roots $left(Delta=k^2+2 k (n+2) (2 n+3)+(n+2)^2,r_1+r_2>0,r_1r_2>0right)$ and, as said in answers, you must discard the one which is > n.






                            share|cite|improve this answer














                            Making the problem more general
                            $$frac1dbinomnr - frac1dbinomn+1r = frackdbinomn+2r$$ and using the same approach as N. F. Taussig in his/her answer, you should end with a quadratic equation in $r$
                            $$k r^2- left(k(2 n+3 )+n+2right)r+kleft( n^2+3 n+2right)=0$$ If $k >0$, there are two positive roots $left(Delta=k^2+2 k (n+2) (2 n+3)+(n+2)^2,r_1+r_2>0,r_1r_2>0right)$ and, as said in answers, you must discard the one which is > n.







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Sep 25 at 6:37

























                            answered Sep 25 at 6:10









                            Claude Leibovici

                            114k1155129




                            114k1155129



























                                 

                                draft saved


                                draft discarded















































                                 


                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function ()
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2929538%2fhow-to-find-the-value-of-r-such-that-frac1-binom9r-frac1-binom%23new-answer', 'question_page');

                                );

                                Post as a guest













































































                                Popular posts from this blog

                                How to check contact read email or not when send email to Individual?

                                Displaying single band from multi-band raster using QGIS

                                How many registers does an x86_64 CPU actually have?