what is the probability that the ID for the first registered user will start with the letter c and end with letter gWould this method yield a truly random sequence?Probability and Combinations - Is my answer correct?Probability of a letter being in a four letter word.Confusing probability question, please help meWhat is the probability that if six letters are selected from the alphabet with replacement that the chosen letters can be used to spell ASSESS?Probability question with black and white marblesProbability of creating a password with 2 digits and 6 letterscomputing probability that at least one letter matches with envelopeWhat is the Probability Generating Function (PGF) for the “Matching Problem”?Probability of substring occurring at the end of a string

Knife as defense against stray dogs

Look at your watch and tell me what time is it. vs Look at your watch and tell me what time it is

Gravity magic - How does it work?

PTIJ: Who should I vote for? (21st Knesset Edition)

Did Ender ever learn that he killed Stilson and/or Bonzo?

Why doesn't using two cd commands in bash script execute the second command?

How to explain that I do not want to visit a country due to personal safety concern?

How to simplify this time periods definition interface?

How to terminate ping <dest> &

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

Does Mathematica reuse previous computations?

Why doesn't the EU now just force the UK to choose between referendum and no-deal?

What options are left, if Britain cannot decide?

Life insurance that covers only simultaneous/dual deaths

Interplanetary conflict, some disease destroys the ability to understand or appreciate music

Brexit - No Deal Rejection

Sailing the cryptic seas

Time travel from stationary position?

Are all passive ability checks floors for active ability checks?

Can a druid choose the size of its wild shape beast?

Is this a real picture of Jordan Peterson in New Zealand with a fan wearing a shirt that says "I'm a Proud Islamaphobe"?

Is it possible to upcast ritual spells?

Why do passenger jet manufacturers design their planes with stall prevention systems?

If the DM rolls initiative once for a group of monsters, how do end-of-turn effects work?



what is the probability that the ID for the first registered user will start with the letter c and end with letter g


Would this method yield a truly random sequence?Probability and Combinations - Is my answer correct?Probability of a letter being in a four letter word.Confusing probability question, please help meWhat is the probability that if six letters are selected from the alphabet with replacement that the chosen letters can be used to spell ASSESS?Probability question with black and white marblesProbability of creating a password with 2 digits and 6 letterscomputing probability that at least one letter matches with envelopeWhat is the Probability Generating Function (PGF) for the “Matching Problem”?Probability of substring occurring at the end of a string













0












$begingroup$


User IDs on an old computer system consist of 4 letter sequences from the first 8 letters of the English alphabet: a, b, c, d, e, f, g, h. Note that the same letter can be used any number of times in the 4 letter sequence. When a new user first registers, an ID is randomly generated(all outcomes equally likely) with the only condition that it is different from the IDs of all previously registered users.



a) How many different IDs are possible for the first registered user? (Just to control myself i found 8x8x8x8= 4,096)



b) What is the probability that the ID for the first registered user will start with the letter c and end with the letter g?










share|cite|improve this question









New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
    $endgroup$
    – Lee David Chung Lin
    Mar 11 at 21:40















0












$begingroup$


User IDs on an old computer system consist of 4 letter sequences from the first 8 letters of the English alphabet: a, b, c, d, e, f, g, h. Note that the same letter can be used any number of times in the 4 letter sequence. When a new user first registers, an ID is randomly generated(all outcomes equally likely) with the only condition that it is different from the IDs of all previously registered users.



a) How many different IDs are possible for the first registered user? (Just to control myself i found 8x8x8x8= 4,096)



b) What is the probability that the ID for the first registered user will start with the letter c and end with the letter g?










share|cite|improve this question









New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
    $endgroup$
    – Lee David Chung Lin
    Mar 11 at 21:40













0












0








0





$begingroup$


User IDs on an old computer system consist of 4 letter sequences from the first 8 letters of the English alphabet: a, b, c, d, e, f, g, h. Note that the same letter can be used any number of times in the 4 letter sequence. When a new user first registers, an ID is randomly generated(all outcomes equally likely) with the only condition that it is different from the IDs of all previously registered users.



a) How many different IDs are possible for the first registered user? (Just to control myself i found 8x8x8x8= 4,096)



b) What is the probability that the ID for the first registered user will start with the letter c and end with the letter g?










share|cite|improve this question









New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




User IDs on an old computer system consist of 4 letter sequences from the first 8 letters of the English alphabet: a, b, c, d, e, f, g, h. Note that the same letter can be used any number of times in the 4 letter sequence. When a new user first registers, an ID is randomly generated(all outcomes equally likely) with the only condition that it is different from the IDs of all previously registered users.



a) How many different IDs are possible for the first registered user? (Just to control myself i found 8x8x8x8= 4,096)



b) What is the probability that the ID for the first registered user will start with the letter c and end with the letter g?







probability statistics random-variables random






share|cite|improve this question









New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited Mar 11 at 21:42







Ziya Arslan













New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Mar 11 at 21:27









Ziya ArslanZiya Arslan

11




11




New contributor




Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ziya Arslan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







  • 1




    $begingroup$
    Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
    $endgroup$
    – Lee David Chung Lin
    Mar 11 at 21:40












  • 1




    $begingroup$
    Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
    $endgroup$
    – Lee David Chung Lin
    Mar 11 at 21:40







1




1




$begingroup$
Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
$endgroup$
– Lee David Chung Lin
Mar 11 at 21:40




$begingroup$
Welcome to MSE. Please include in the body of the question your own thoughts, the effort made so far, and the specific difficulties that got you stuck. Otherwise this question is likely to be closed via community votes or just be ignored. Also, please click on the tiny edit and use MathJax to properly typeset math expressions.
$endgroup$
– Lee David Chung Lin
Mar 11 at 21:40










1 Answer
1






active

oldest

votes


















1












$begingroup$

You correctly found that there are $8^4=4096$ possible equally likely ids that could be generated for the user.



Now... if it starts with a $c$ and ends with a $g$... then we have in essence $1$ option for the first character (it must be a c), $8$ options for the second character (it could be any of a,b,...,h), $8$ options again for the third character, and $1$ option for the final character (it must be a g).



Applying the rule of product, by multiplying the number of options available for each position we get the total number of passwords which begin with a $c$ and end with a $g$.



Dividing the result by the number of possible ids (noting that the ids are equally likely to occur) gives us the desired probability.



(Note: the number of "good occurrences" divided by the number of "possible occurrences" giving the probability is only a valid technique in the situation where each possible occurrence is explicitly known to be equally likely to occur. It may not be used in situations outside of that and can and will frequently lead to incorrect answers if this warning is ignored)






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
    );



    );






    Ziya Arslan is a new contributor. Be nice, and check out our Code of Conduct.









    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3144272%2fwhat-is-the-probability-that-the-id-for-the-first-registered-user-will-start-wit%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$

    You correctly found that there are $8^4=4096$ possible equally likely ids that could be generated for the user.



    Now... if it starts with a $c$ and ends with a $g$... then we have in essence $1$ option for the first character (it must be a c), $8$ options for the second character (it could be any of a,b,...,h), $8$ options again for the third character, and $1$ option for the final character (it must be a g).



    Applying the rule of product, by multiplying the number of options available for each position we get the total number of passwords which begin with a $c$ and end with a $g$.



    Dividing the result by the number of possible ids (noting that the ids are equally likely to occur) gives us the desired probability.



    (Note: the number of "good occurrences" divided by the number of "possible occurrences" giving the probability is only a valid technique in the situation where each possible occurrence is explicitly known to be equally likely to occur. It may not be used in situations outside of that and can and will frequently lead to incorrect answers if this warning is ignored)






    share|cite|improve this answer









    $endgroup$

















      1












      $begingroup$

      You correctly found that there are $8^4=4096$ possible equally likely ids that could be generated for the user.



      Now... if it starts with a $c$ and ends with a $g$... then we have in essence $1$ option for the first character (it must be a c), $8$ options for the second character (it could be any of a,b,...,h), $8$ options again for the third character, and $1$ option for the final character (it must be a g).



      Applying the rule of product, by multiplying the number of options available for each position we get the total number of passwords which begin with a $c$ and end with a $g$.



      Dividing the result by the number of possible ids (noting that the ids are equally likely to occur) gives us the desired probability.



      (Note: the number of "good occurrences" divided by the number of "possible occurrences" giving the probability is only a valid technique in the situation where each possible occurrence is explicitly known to be equally likely to occur. It may not be used in situations outside of that and can and will frequently lead to incorrect answers if this warning is ignored)






      share|cite|improve this answer









      $endgroup$















        1












        1








        1





        $begingroup$

        You correctly found that there are $8^4=4096$ possible equally likely ids that could be generated for the user.



        Now... if it starts with a $c$ and ends with a $g$... then we have in essence $1$ option for the first character (it must be a c), $8$ options for the second character (it could be any of a,b,...,h), $8$ options again for the third character, and $1$ option for the final character (it must be a g).



        Applying the rule of product, by multiplying the number of options available for each position we get the total number of passwords which begin with a $c$ and end with a $g$.



        Dividing the result by the number of possible ids (noting that the ids are equally likely to occur) gives us the desired probability.



        (Note: the number of "good occurrences" divided by the number of "possible occurrences" giving the probability is only a valid technique in the situation where each possible occurrence is explicitly known to be equally likely to occur. It may not be used in situations outside of that and can and will frequently lead to incorrect answers if this warning is ignored)






        share|cite|improve this answer









        $endgroup$



        You correctly found that there are $8^4=4096$ possible equally likely ids that could be generated for the user.



        Now... if it starts with a $c$ and ends with a $g$... then we have in essence $1$ option for the first character (it must be a c), $8$ options for the second character (it could be any of a,b,...,h), $8$ options again for the third character, and $1$ option for the final character (it must be a g).



        Applying the rule of product, by multiplying the number of options available for each position we get the total number of passwords which begin with a $c$ and end with a $g$.



        Dividing the result by the number of possible ids (noting that the ids are equally likely to occur) gives us the desired probability.



        (Note: the number of "good occurrences" divided by the number of "possible occurrences" giving the probability is only a valid technique in the situation where each possible occurrence is explicitly known to be equally likely to occur. It may not be used in situations outside of that and can and will frequently lead to incorrect answers if this warning is ignored)







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 11 at 23:20









        JMoravitzJMoravitz

        48.5k43988




        48.5k43988




















            Ziya Arslan is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            Ziya Arslan is a new contributor. Be nice, and check out our Code of Conduct.












            Ziya Arslan is a new contributor. Be nice, and check out our Code of Conduct.











            Ziya Arslan is a new contributor. Be nice, and check out our Code of Conduct.














            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%2f3144272%2fwhat-is-the-probability-that-the-id-for-the-first-registered-user-will-start-wit%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