An algorithm randomly generates a sequence $(c_1, c_2,… c_n)$ The Next CEO of Stack OverflowLottery with coupon collecting - what prices are fair?Distribution of # balls in each container (balls dropped randomly)Proof: Probability using InductionSampling from weighted sum distributionProbability of disjoint cycles.How to account for revealed cards in a model of a poorly shuffled deck?Urn with an infinite number of balls of finite, uniformly distributed coloursExpected Balls in Bins of Unequal CapacitiesExpected length of randomly generated decreasing sequenceProbability that sum of three digits is the same as sum of other three digits

Is a distribution that is normal, but highly skewed considered Gaussian?

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

I want to delete every two lines after 3rd lines in file contain very large number of lines :

Missile strike detection (but it's not actually a missile)

Prepend last line of stdin to entire stdin

A Man With a Stainless Steel Endoskeleton (like The Terminator) Fighting Cloaked Aliens Only He Can See

Rotate a column

WOW air has ceased operation, can I get my tickets refunded?

Would a grinding machine be a simple and workable propulsion system for an interplanetary spacecraft?

Newlines in BSD sed vs gsed

What does "Its cash flow is deeply negative" mean?

What flight has the highest ratio of time difference to flight time?

How did people program for Consoles with multiple CPUs?

Why don't programming languages automatically manage the synchronous/asynchronous problem?

Find non-case sensitive string in a mixed list of elements?

What steps are necessary to read a Modern SSD in Medieval Europe?

Does soap repel water?

Reference request: Grassmannian and Plucker coordinates in type B, C, D

Unclear about dynamic binding

Some questions about different axiomatic systems for neighbourhoods

What happened in Rome, when the western empire "fell"?

Writing differences on a blackboard

Is it convenient to ask the journal's editor for two additional days to complete a review?

Make solar eclipses exceedingly rare, but still have new moons



An algorithm randomly generates a sequence $(c_1, c_2,… c_n)$



The Next CEO of Stack OverflowLottery with coupon collecting - what prices are fair?Distribution of # balls in each container (balls dropped randomly)Proof: Probability using InductionSampling from weighted sum distributionProbability of disjoint cycles.How to account for revealed cards in a model of a poorly shuffled deck?Urn with an infinite number of balls of finite, uniformly distributed coloursExpected Balls in Bins of Unequal CapacitiesExpected length of randomly generated decreasing sequenceProbability that sum of three digits is the same as sum of other three digits










-1












$begingroup$


An algorithm randomly generates a sequence $(c_1, c_2,... c_n)$, where each $c_i$ can assume the values $0$, $1$ or $2$. Given $A_k =$ $k$ values of the sequence are equal to $0$ and $B_j$ = $j$ values of the sequence are equal to $1$.



How to calculate $P (A_k)$, for $k = 0, 1,. . . , n$?










share|cite|improve this question









$endgroup$
















    -1












    $begingroup$


    An algorithm randomly generates a sequence $(c_1, c_2,... c_n)$, where each $c_i$ can assume the values $0$, $1$ or $2$. Given $A_k =$ $k$ values of the sequence are equal to $0$ and $B_j$ = $j$ values of the sequence are equal to $1$.



    How to calculate $P (A_k)$, for $k = 0, 1,. . . , n$?










    share|cite|improve this question









    $endgroup$














      -1












      -1








      -1





      $begingroup$


      An algorithm randomly generates a sequence $(c_1, c_2,... c_n)$, where each $c_i$ can assume the values $0$, $1$ or $2$. Given $A_k =$ $k$ values of the sequence are equal to $0$ and $B_j$ = $j$ values of the sequence are equal to $1$.



      How to calculate $P (A_k)$, for $k = 0, 1,. . . , n$?










      share|cite|improve this question









      $endgroup$




      An algorithm randomly generates a sequence $(c_1, c_2,... c_n)$, where each $c_i$ can assume the values $0$, $1$ or $2$. Given $A_k =$ $k$ values of the sequence are equal to $0$ and $B_j$ = $j$ values of the sequence are equal to $1$.



      How to calculate $P (A_k)$, for $k = 0, 1,. . . , n$?







      probability statistics






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 27 at 19:08









      user649882user649882

      144




      144




















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          $A_k$ follows a binomial distribution where the probability of success $p = 1/3$ and the probability of failure is $q = 2/3$. Note that I am assuming that $c_i sim U(3)$ iid. Thus
          $$P(A_k)=binomnkp^kq^n-k.$$






          share|cite|improve this answer









          $endgroup$













            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%2f3164975%2fan-algorithm-randomly-generates-a-sequence-c-1-c-2-c-n%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









            0












            $begingroup$

            $A_k$ follows a binomial distribution where the probability of success $p = 1/3$ and the probability of failure is $q = 2/3$. Note that I am assuming that $c_i sim U(3)$ iid. Thus
            $$P(A_k)=binomnkp^kq^n-k.$$






            share|cite|improve this answer









            $endgroup$

















              0












              $begingroup$

              $A_k$ follows a binomial distribution where the probability of success $p = 1/3$ and the probability of failure is $q = 2/3$. Note that I am assuming that $c_i sim U(3)$ iid. Thus
              $$P(A_k)=binomnkp^kq^n-k.$$






              share|cite|improve this answer









              $endgroup$















                0












                0








                0





                $begingroup$

                $A_k$ follows a binomial distribution where the probability of success $p = 1/3$ and the probability of failure is $q = 2/3$. Note that I am assuming that $c_i sim U(3)$ iid. Thus
                $$P(A_k)=binomnkp^kq^n-k.$$






                share|cite|improve this answer









                $endgroup$



                $A_k$ follows a binomial distribution where the probability of success $p = 1/3$ and the probability of failure is $q = 2/3$. Note that I am assuming that $c_i sim U(3)$ iid. Thus
                $$P(A_k)=binomnkp^kq^n-k.$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 27 at 19:17









                model_checkermodel_checker

                4,41621931




                4,41621931



























                    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%2f3164975%2fan-algorithm-randomly-generates-a-sequence-c-1-c-2-c-n%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

                    Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

                    Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

                    Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ