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

            Solar Wings Breeze Design and development Specifications (Breeze) References Navigation menu1368-485X"Hang glider: Breeze (Solar Wings)"e

            Kathakali Contents Etymology and nomenclature History Repertoire Songs and musical instruments Traditional plays Styles: Sampradayam Training centers and awards Relationship to other dance forms See also Notes References External links Navigation menueThe Illustrated Encyclopedia of Hinduism: A-MSouth Asian Folklore: An EncyclopediaRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to Play10.1353/atj.2005.0004The Illustrated Encyclopedia of Hinduism: A-MEncyclopedia of HinduismKathakali Dance-drama: Where Gods and Demons Come to PlaySonic Liturgy: Ritual and Music in Hindu Tradition"The Mirror of Gesture"Kathakali Dance-drama: Where Gods and Demons Come to Play"Kathakali"Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceMedieval Indian Literature: An AnthologyThe Oxford Companion to Indian TheatreSouth Asian Folklore: An Encyclopedia : Afghanistan, Bangladesh, India, Nepal, Pakistan, Sri LankaThe Rise of Performance Studies: Rethinking Richard Schechner's Broad SpectrumIndian Theatre: Traditions of PerformanceModern Asian Theatre and Performance 1900-2000Critical Theory and PerformanceBetween Theater and AnthropologyKathakali603847011Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceBetween Theater and AnthropologyBetween Theater and AnthropologyNambeesan Smaraka AwardsArchivedThe Cambridge Guide to TheatreRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeThe Garland Encyclopedia of World Music: South Asia : the Indian subcontinentThe Ethos of Noh: Actors and Their Art10.2307/1145740By Means of Performance: Intercultural Studies of Theatre and Ritual10.1017/s204912550000100xReconceiving the Renaissance: A Critical ReaderPerformance TheoryListening to Theatre: The Aural Dimension of Beijing Opera10.2307/1146013Kathakali: The Art of the Non-WorldlyOn KathakaliKathakali, the dance theatreThe Kathakali Complex: Performance & StructureKathakali Dance-Drama: Where Gods and Demons Come to Play10.1093/obo/9780195399318-0071Drama and Ritual of Early Hinduism"In the Shadow of Hollywood Orientalism: Authentic East Indian Dancing"10.1080/08949460490274013Sanskrit Play Production in Ancient IndiaIndian Music: History and StructureBharata, the Nāṭyaśāstra233639306Table of Contents2238067286469807Dance In Indian Painting10.2307/32047833204783Kathakali Dance-Theatre: A Visual Narrative of Sacred Indian MimeIndian Classical Dance: The Renaissance and BeyondKathakali: an indigenous art-form of Keralaeee

            Method to test if a number is a perfect power? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Detecting perfect squares faster than by extracting square rooteffective way to get the integer sequence A181392 from oeisA rarely mentioned fact about perfect powersHow many numbers such $n$ are there that $n<100,lfloorsqrtn rfloor mid n$Check perfect squareness by modulo division against multiple basesFor what pair of integers $(a,b)$ is $3^a + 7^b$ a perfect square.Do there exist any positive integers $n$ such that $lfloore^nrfloor$ is a perfect power? What is the probability that one exists?finding perfect power factors of an integerProve that the sequence contains a perfect square for any natural number $m $ in the domain of $f$ .Counting Perfect Powers