Probability of 8 bit binary string whose first three bits are 001, 010, or 100.Probability - Combinations and permutationsProbability of choosing two equal bits from three random bitsA probabilty of error calculationBitstring ProbabilityProbability problem involving random stringsFlawed understanding of independent eventsCombined probability of hit in look up tables with some common index bitsHelp with total probability of a transmitted message (Total probability?)expected error when flipping bits of binary stringConfused with probability

How can I deal with my CEO asking me to hire someone with a higher salary than me, a co-founder?

What are the G forces leaving Earth orbit?

Processor speed limited at 0.4 Ghz

Unlock My Phone! February 2018

Is it possible to map the firing of neurons in the human brain so as to stimulate artificial memories in someone else?

Was the Stack Exchange "Happy April Fools" page fitting with the '90's code?

How do I exit BASH while loop using modulus operator?

Getting extremely large arrows with tikzcd

Mathematica command that allows it to read my intentions

Car headlights in a world without electricity

In the UK, is it possible to get a referendum by a court decision?

How dangerous is XSS

How badly should I try to prevent a user from XSSing themselves?

Why were 5.25" floppy drives cheaper than 8"?

What's the meaning of "Sollensaussagen"?

Why was Sir Cadogan fired?

Where would I need my direct neural interface to be implanted?

What is the fastest integer factorization to break RSA?

How to prevent "they're falling in love" trope

Notepad++ delete until colon for every line with replace all

Is this draw by repetition?

Can a virus destroy the BIOS of a modern computer?

Can someone clarify Hamming's notion of important problems in relation to modern academia?

Placement of More Information/Help Icon button for Radio Buttons



Probability of 8 bit binary string whose first three bits are 001, 010, or 100.


Probability - Combinations and permutationsProbability of choosing two equal bits from three random bitsA probabilty of error calculationBitstring ProbabilityProbability problem involving random stringsFlawed understanding of independent eventsCombined probability of hit in look up tables with some common index bitsHelp with total probability of a transmitted message (Total probability?)expected error when flipping bits of binary stringConfused with probability













0












$begingroup$


A bit unsure of how to approach the following question.



Consider the uniform probability space where the set of outcomes consists of all 8-bit binary strings. What is the probability of each of the following events?



a) The first three bits of the string are 001, 010, or 100.



I calculated the total number of 8 bit string sequences to be 2^8 or 256.



Now, do I calculate the probability of the first three digits being a particular sequence in the following way :



Pr["001"] = .5 x .5 x .5 = .125 or 32 sequences
Pr["010"] = .5 x .5 x .5 = .125 or 32 sequesces
Pr["111"] = .5 x .5 x .5 = .125 or 32 sequences



Pr[001 or 010 or 111] = (32 + 32 + 32)/256 = .375



I feel I might be doing something wrong. Any help would be greatly appreciated!










share|cite|improve this question









$endgroup$







  • 5




    $begingroup$
    You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
    $endgroup$
    – Don Thousand
    Mar 20 at 18:20















0












$begingroup$


A bit unsure of how to approach the following question.



Consider the uniform probability space where the set of outcomes consists of all 8-bit binary strings. What is the probability of each of the following events?



a) The first three bits of the string are 001, 010, or 100.



I calculated the total number of 8 bit string sequences to be 2^8 or 256.



Now, do I calculate the probability of the first three digits being a particular sequence in the following way :



Pr["001"] = .5 x .5 x .5 = .125 or 32 sequences
Pr["010"] = .5 x .5 x .5 = .125 or 32 sequesces
Pr["111"] = .5 x .5 x .5 = .125 or 32 sequences



Pr[001 or 010 or 111] = (32 + 32 + 32)/256 = .375



I feel I might be doing something wrong. Any help would be greatly appreciated!










share|cite|improve this question









$endgroup$







  • 5




    $begingroup$
    You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
    $endgroup$
    – Don Thousand
    Mar 20 at 18:20













0












0








0





$begingroup$


A bit unsure of how to approach the following question.



Consider the uniform probability space where the set of outcomes consists of all 8-bit binary strings. What is the probability of each of the following events?



a) The first three bits of the string are 001, 010, or 100.



I calculated the total number of 8 bit string sequences to be 2^8 or 256.



Now, do I calculate the probability of the first three digits being a particular sequence in the following way :



Pr["001"] = .5 x .5 x .5 = .125 or 32 sequences
Pr["010"] = .5 x .5 x .5 = .125 or 32 sequesces
Pr["111"] = .5 x .5 x .5 = .125 or 32 sequences



Pr[001 or 010 or 111] = (32 + 32 + 32)/256 = .375



I feel I might be doing something wrong. Any help would be greatly appreciated!










share|cite|improve this question









$endgroup$




A bit unsure of how to approach the following question.



Consider the uniform probability space where the set of outcomes consists of all 8-bit binary strings. What is the probability of each of the following events?



a) The first three bits of the string are 001, 010, or 100.



I calculated the total number of 8 bit string sequences to be 2^8 or 256.



Now, do I calculate the probability of the first three digits being a particular sequence in the following way :



Pr["001"] = .5 x .5 x .5 = .125 or 32 sequences
Pr["010"] = .5 x .5 x .5 = .125 or 32 sequesces
Pr["111"] = .5 x .5 x .5 = .125 or 32 sequences



Pr[001 or 010 or 111] = (32 + 32 + 32)/256 = .375



I feel I might be doing something wrong. Any help would be greatly appreciated!







probability






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 20 at 18:18









RobinRobin

525




525







  • 5




    $begingroup$
    You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
    $endgroup$
    – Don Thousand
    Mar 20 at 18:20












  • 5




    $begingroup$
    You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
    $endgroup$
    – Don Thousand
    Mar 20 at 18:20







5




5




$begingroup$
You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
$endgroup$
– Don Thousand
Mar 20 at 18:20




$begingroup$
You are correct, but you could have done this problem a lot more easily. You note that each bit is independent of the next, so you can just take the space of all 3 bit strings, and find the probability that a given one is one of the three you've chosen. That immediately gives you $frac38$.
$endgroup$
– Don Thousand
Mar 20 at 18:20










1 Answer
1






active

oldest

votes


















1












$begingroup$

We have three chances of getting the first three bits with a single one out of the $2^3$ possibilities. That's $frac38$. Then we have $2^5$ combinations for the remaining five bits but they don't matter because, for every value they may have, there is still the $frac38$ chance that the leading digits will have one one. Answer: $frac38= 0.375$ so you got it right.






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%2f3155823%2fprobability-of-8-bit-binary-string-whose-first-three-bits-are-001-010-or-100%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









    1












    $begingroup$

    We have three chances of getting the first three bits with a single one out of the $2^3$ possibilities. That's $frac38$. Then we have $2^5$ combinations for the remaining five bits but they don't matter because, for every value they may have, there is still the $frac38$ chance that the leading digits will have one one. Answer: $frac38= 0.375$ so you got it right.






    share|cite|improve this answer











    $endgroup$

















      1












      $begingroup$

      We have three chances of getting the first three bits with a single one out of the $2^3$ possibilities. That's $frac38$. Then we have $2^5$ combinations for the remaining five bits but they don't matter because, for every value they may have, there is still the $frac38$ chance that the leading digits will have one one. Answer: $frac38= 0.375$ so you got it right.






      share|cite|improve this answer











      $endgroup$















        1












        1








        1





        $begingroup$

        We have three chances of getting the first three bits with a single one out of the $2^3$ possibilities. That's $frac38$. Then we have $2^5$ combinations for the remaining five bits but they don't matter because, for every value they may have, there is still the $frac38$ chance that the leading digits will have one one. Answer: $frac38= 0.375$ so you got it right.






        share|cite|improve this answer











        $endgroup$



        We have three chances of getting the first three bits with a single one out of the $2^3$ possibilities. That's $frac38$. Then we have $2^5$ combinations for the remaining five bits but they don't matter because, for every value they may have, there is still the $frac38$ chance that the leading digits will have one one. Answer: $frac38= 0.375$ so you got it right.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Mar 21 at 18:02

























        answered Mar 20 at 18:42









        poetasispoetasis

        432317




        432317



























            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%2f3155823%2fprobability-of-8-bit-binary-string-whose-first-three-bits-are-001-010-or-100%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

            How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

            random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

            Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye