How can I get N trials from binomial distribution (Edited)











up vote
0
down vote

favorite












$$
sum_{k=0}^{17}{_NC_k}times 0.1^ktimes 0.9^{N-k}<0.004
$$



How can I get a $N$ from above inequality?










share|cite|improve this question






















  • If $N=17$ the LHS is $1$...
    – gt6989b
    Sep 7 at 11:39










  • $N$ is not 17, I don't know $N$
    – baeharam
    Sep 7 at 11:42










  • This answer to this related (but distinct) question is relevant.
    – joriki
    Sep 7 at 12:16










  • I cannot understand what he says, what is it about?
    – baeharam
    Sep 7 at 12:22















up vote
0
down vote

favorite












$$
sum_{k=0}^{17}{_NC_k}times 0.1^ktimes 0.9^{N-k}<0.004
$$



How can I get a $N$ from above inequality?










share|cite|improve this question






















  • If $N=17$ the LHS is $1$...
    – gt6989b
    Sep 7 at 11:39










  • $N$ is not 17, I don't know $N$
    – baeharam
    Sep 7 at 11:42










  • This answer to this related (but distinct) question is relevant.
    – joriki
    Sep 7 at 12:16










  • I cannot understand what he says, what is it about?
    – baeharam
    Sep 7 at 12:22













up vote
0
down vote

favorite









up vote
0
down vote

favorite











$$
sum_{k=0}^{17}{_NC_k}times 0.1^ktimes 0.9^{N-k}<0.004
$$



How can I get a $N$ from above inequality?










share|cite|improve this question













$$
sum_{k=0}^{17}{_NC_k}times 0.1^ktimes 0.9^{N-k}<0.004
$$



How can I get a $N$ from above inequality?







binomial-distribution






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Sep 7 at 11:32









baeharam

567




567












  • If $N=17$ the LHS is $1$...
    – gt6989b
    Sep 7 at 11:39










  • $N$ is not 17, I don't know $N$
    – baeharam
    Sep 7 at 11:42










  • This answer to this related (but distinct) question is relevant.
    – joriki
    Sep 7 at 12:16










  • I cannot understand what he says, what is it about?
    – baeharam
    Sep 7 at 12:22


















  • If $N=17$ the LHS is $1$...
    – gt6989b
    Sep 7 at 11:39










  • $N$ is not 17, I don't know $N$
    – baeharam
    Sep 7 at 11:42










  • This answer to this related (but distinct) question is relevant.
    – joriki
    Sep 7 at 12:16










  • I cannot understand what he says, what is it about?
    – baeharam
    Sep 7 at 12:22
















If $N=17$ the LHS is $1$...
– gt6989b
Sep 7 at 11:39




If $N=17$ the LHS is $1$...
– gt6989b
Sep 7 at 11:39












$N$ is not 17, I don't know $N$
– baeharam
Sep 7 at 11:42




$N$ is not 17, I don't know $N$
– baeharam
Sep 7 at 11:42












This answer to this related (but distinct) question is relevant.
– joriki
Sep 7 at 12:16




This answer to this related (but distinct) question is relevant.
– joriki
Sep 7 at 12:16












I cannot understand what he says, what is it about?
– baeharam
Sep 7 at 12:22




I cannot understand what he says, what is it about?
– baeharam
Sep 7 at 12:22










1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










As commented by @joriki, in general for this summation a numerical approach is the way to go.



Courtesy of Wolfram Alpha, after some quick trial and error one finds that at $N = 305$ the summation is about 0.00405, and at $N = 306$ the sum is roughly 0.00385.



The minimal $N$ that satisfies your inequality is $N = 306$, which happens to be a multiple of 17.



Whether there's an analytic solution for this particular set of numbers ($17$ and $0.004 = frac2{500}$ with $p=0.1 = frac1{10}$) is beyond me, and I'd like to hear from anyone who has an idea.






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: 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%2f2908528%2fhow-can-i-get-n-trials-from-binomial-distribution-edited%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote



    accepted










    As commented by @joriki, in general for this summation a numerical approach is the way to go.



    Courtesy of Wolfram Alpha, after some quick trial and error one finds that at $N = 305$ the summation is about 0.00405, and at $N = 306$ the sum is roughly 0.00385.



    The minimal $N$ that satisfies your inequality is $N = 306$, which happens to be a multiple of 17.



    Whether there's an analytic solution for this particular set of numbers ($17$ and $0.004 = frac2{500}$ with $p=0.1 = frac1{10}$) is beyond me, and I'd like to hear from anyone who has an idea.






    share|cite|improve this answer



























      up vote
      1
      down vote



      accepted










      As commented by @joriki, in general for this summation a numerical approach is the way to go.



      Courtesy of Wolfram Alpha, after some quick trial and error one finds that at $N = 305$ the summation is about 0.00405, and at $N = 306$ the sum is roughly 0.00385.



      The minimal $N$ that satisfies your inequality is $N = 306$, which happens to be a multiple of 17.



      Whether there's an analytic solution for this particular set of numbers ($17$ and $0.004 = frac2{500}$ with $p=0.1 = frac1{10}$) is beyond me, and I'd like to hear from anyone who has an idea.






      share|cite|improve this answer

























        up vote
        1
        down vote



        accepted







        up vote
        1
        down vote



        accepted






        As commented by @joriki, in general for this summation a numerical approach is the way to go.



        Courtesy of Wolfram Alpha, after some quick trial and error one finds that at $N = 305$ the summation is about 0.00405, and at $N = 306$ the sum is roughly 0.00385.



        The minimal $N$ that satisfies your inequality is $N = 306$, which happens to be a multiple of 17.



        Whether there's an analytic solution for this particular set of numbers ($17$ and $0.004 = frac2{500}$ with $p=0.1 = frac1{10}$) is beyond me, and I'd like to hear from anyone who has an idea.






        share|cite|improve this answer














        As commented by @joriki, in general for this summation a numerical approach is the way to go.



        Courtesy of Wolfram Alpha, after some quick trial and error one finds that at $N = 305$ the summation is about 0.00405, and at $N = 306$ the sum is roughly 0.00385.



        The minimal $N$ that satisfies your inequality is $N = 306$, which happens to be a multiple of 17.



        Whether there's an analytic solution for this particular set of numbers ($17$ and $0.004 = frac2{500}$ with $p=0.1 = frac1{10}$) is beyond me, and I'd like to hear from anyone who has an idea.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 10 hours ago

























        answered Sep 7 at 13:13









        Lee David Chung Lin

        3,31931038




        3,31931038






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2908528%2fhow-can-i-get-n-trials-from-binomial-distribution-edited%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

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            ts Property 'filter' does not exist on type '{}'

            mat-slide-toggle shouldn't change it's state when I click cancel in confirmation window