Solving binomial coefficient inequality

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











up vote
0
down vote

favorite












I have the following inequality,
$$binombinomnkabinombinomnk-lb<binombinomnka+btag 1$$
I was wondering how one solves this exact / approximately for l?










share|cite|improve this question



















  • 1




    Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
    – Aleksejs Fomins
    Sep 4 at 13:10











  • @AleksejsFomins yes that is true.
    – William
    Sep 4 at 13:11










  • does my answer work for you?
    – Aleksejs Fomins
    Sep 4 at 14:46










  • @AleksejsFomins unfortunately not, as I will need an analytical form.
    – William
    Sep 4 at 15:22







  • 2




    what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
    – Aleksejs Fomins
    Sep 4 at 15:31















up vote
0
down vote

favorite












I have the following inequality,
$$binombinomnkabinombinomnk-lb<binombinomnka+btag 1$$
I was wondering how one solves this exact / approximately for l?










share|cite|improve this question



















  • 1




    Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
    – Aleksejs Fomins
    Sep 4 at 13:10











  • @AleksejsFomins yes that is true.
    – William
    Sep 4 at 13:11










  • does my answer work for you?
    – Aleksejs Fomins
    Sep 4 at 14:46










  • @AleksejsFomins unfortunately not, as I will need an analytical form.
    – William
    Sep 4 at 15:22







  • 2




    what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
    – Aleksejs Fomins
    Sep 4 at 15:31













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have the following inequality,
$$binombinomnkabinombinomnk-lb<binombinomnka+btag 1$$
I was wondering how one solves this exact / approximately for l?










share|cite|improve this question















I have the following inequality,
$$binombinomnkabinombinomnk-lb<binombinomnka+btag 1$$
I was wondering how one solves this exact / approximately for l?







combinatorics inequality binomial-coefficients






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 4 at 20:20

























asked Sep 4 at 13:00









William

131111




131111







  • 1




    Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
    – Aleksejs Fomins
    Sep 4 at 13:10











  • @AleksejsFomins yes that is true.
    – William
    Sep 4 at 13:11










  • does my answer work for you?
    – Aleksejs Fomins
    Sep 4 at 14:46










  • @AleksejsFomins unfortunately not, as I will need an analytical form.
    – William
    Sep 4 at 15:22







  • 2




    what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
    – Aleksejs Fomins
    Sep 4 at 15:31













  • 1




    Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
    – Aleksejs Fomins
    Sep 4 at 13:10











  • @AleksejsFomins yes that is true.
    – William
    Sep 4 at 13:11










  • does my answer work for you?
    – Aleksejs Fomins
    Sep 4 at 14:46










  • @AleksejsFomins unfortunately not, as I will need an analytical form.
    – William
    Sep 4 at 15:22







  • 2




    what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
    – Aleksejs Fomins
    Sep 4 at 15:31








1




1




Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
– Aleksejs Fomins
Sep 4 at 13:10





Just checking - we assume that all variables are known except $l$, and we want to find the values of $l$ for which the inequality is true, right?
– Aleksejs Fomins
Sep 4 at 13:10













@AleksejsFomins yes that is true.
– William
Sep 4 at 13:11




@AleksejsFomins yes that is true.
– William
Sep 4 at 13:11












does my answer work for you?
– Aleksejs Fomins
Sep 4 at 14:46




does my answer work for you?
– Aleksejs Fomins
Sep 4 at 14:46












@AleksejsFomins unfortunately not, as I will need an analytical form.
– William
Sep 4 at 15:22





@AleksejsFomins unfortunately not, as I will need an analytical form.
– William
Sep 4 at 15:22





2




2




what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
– Aleksejs Fomins
Sep 4 at 15:31





what makes you think that it is at all possible? Searching for zeros of high-dimensional polynomials is a notoriously hard problem which is unsolvable analytically for dimensions 5 and higher, and you can't solve inequalities if you can't solve for zeros. I can refer you to a few publications if you wish. Unless there is some significant symmetry in the above expression that I missed, it is very unlikely that it is solvable analytically
– Aleksejs Fomins
Sep 4 at 15:31











1 Answer
1






active

oldest

votes

















up vote
1
down vote













If you substitute all combination expressions inside and open all the brackets, you will end up with a fraction $fracP(l)Q(l) < 0$, where $P(l)$ and $Q(l)$ are polynomials. You can then attempt to factorize each polynomial into linear multipliers and apply the standard high-school polynomial inequality solution method to determine for which intervals of the real line is the LHS of the equation positive and for which negative, and then determine which integer values of $l$ fit into the positive intervals.



However, if you do that, you will get into a giant mess, because factoring a polynomial containing products of products of factorials will give you thousands of zeros on your real line. Since $l$ is integer, why not just write a computer program checking if the inequality holds for each value of $l$ from $0$ to $k$?






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%2f2905032%2fsolving-binomial-coefficient-inequality%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote













    If you substitute all combination expressions inside and open all the brackets, you will end up with a fraction $fracP(l)Q(l) < 0$, where $P(l)$ and $Q(l)$ are polynomials. You can then attempt to factorize each polynomial into linear multipliers and apply the standard high-school polynomial inequality solution method to determine for which intervals of the real line is the LHS of the equation positive and for which negative, and then determine which integer values of $l$ fit into the positive intervals.



    However, if you do that, you will get into a giant mess, because factoring a polynomial containing products of products of factorials will give you thousands of zeros on your real line. Since $l$ is integer, why not just write a computer program checking if the inequality holds for each value of $l$ from $0$ to $k$?






    share|cite|improve this answer
























      up vote
      1
      down vote













      If you substitute all combination expressions inside and open all the brackets, you will end up with a fraction $fracP(l)Q(l) < 0$, where $P(l)$ and $Q(l)$ are polynomials. You can then attempt to factorize each polynomial into linear multipliers and apply the standard high-school polynomial inequality solution method to determine for which intervals of the real line is the LHS of the equation positive and for which negative, and then determine which integer values of $l$ fit into the positive intervals.



      However, if you do that, you will get into a giant mess, because factoring a polynomial containing products of products of factorials will give you thousands of zeros on your real line. Since $l$ is integer, why not just write a computer program checking if the inequality holds for each value of $l$ from $0$ to $k$?






      share|cite|improve this answer






















        up vote
        1
        down vote










        up vote
        1
        down vote









        If you substitute all combination expressions inside and open all the brackets, you will end up with a fraction $fracP(l)Q(l) < 0$, where $P(l)$ and $Q(l)$ are polynomials. You can then attempt to factorize each polynomial into linear multipliers and apply the standard high-school polynomial inequality solution method to determine for which intervals of the real line is the LHS of the equation positive and for which negative, and then determine which integer values of $l$ fit into the positive intervals.



        However, if you do that, you will get into a giant mess, because factoring a polynomial containing products of products of factorials will give you thousands of zeros on your real line. Since $l$ is integer, why not just write a computer program checking if the inequality holds for each value of $l$ from $0$ to $k$?






        share|cite|improve this answer












        If you substitute all combination expressions inside and open all the brackets, you will end up with a fraction $fracP(l)Q(l) < 0$, where $P(l)$ and $Q(l)$ are polynomials. You can then attempt to factorize each polynomial into linear multipliers and apply the standard high-school polynomial inequality solution method to determine for which intervals of the real line is the LHS of the equation positive and for which negative, and then determine which integer values of $l$ fit into the positive intervals.



        However, if you do that, you will get into a giant mess, because factoring a polynomial containing products of products of factorials will give you thousands of zeros on your real line. Since $l$ is integer, why not just write a computer program checking if the inequality holds for each value of $l$ from $0$ to $k$?







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Sep 4 at 13:34









        Aleksejs Fomins

        388111




        388111



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2905032%2fsolving-binomial-coefficient-inequality%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            How to combine Bézier curves to a surface?

            Mutual Information Always Non-negative

            Why am i infinitely getting the same tweet with the Twitter Search API?