Probability and using Time with Passwords and combinations
$begingroup$
Consider Bob, an absent-minded student. Bob has a set of 6 passwords that he uses for all his login needs. He often forgets which password matches with which website so his strategy is to try all of them. Specifically, from his set of passwords he picks one uniformly at random and enters it. If he succeeds – all is well; if he fails – he removes the password from the set and repeats the process.
a. Suppose Bob has to log on to a website he hasn’t used for some time. Define X as the random variable equal to the number of times Bob enters a password before he can log on to the site. Describe the probability distribution of X and compute $E[X]$.
b. It turns out that the website has a policy that if a user fails to enter the correct password for k consecutive times, it will delay logging in the user by 2k seconds. For example, if Bob gets the password right the first time, Bob experiences a delay of $2^0 = 1$ second before he is logged on to the website. If Bob gets the password right the second time, he experiences a delay of $2^1 = 2$ seconds before he is logged on to the website, etc. Let Y be the random variable equal to delay time Bob experiences. Describe the probability distribution of Y and compute $E[Y ]$.
I have attempted to solve this problem but seem to lack any understanding of what I am really supposed to do or how to check my work. Is it asking for how many ways I can arrange passwords, or how many times I can get it wrong then right? I feel like its something like $(frac56)(frac16)$ would be him failing the first time and then getting it the second time but im not sure I should be using something quite like that, and how it would affect time.
probability discrete-mathematics probability-distributions
$endgroup$
add a comment |
$begingroup$
Consider Bob, an absent-minded student. Bob has a set of 6 passwords that he uses for all his login needs. He often forgets which password matches with which website so his strategy is to try all of them. Specifically, from his set of passwords he picks one uniformly at random and enters it. If he succeeds – all is well; if he fails – he removes the password from the set and repeats the process.
a. Suppose Bob has to log on to a website he hasn’t used for some time. Define X as the random variable equal to the number of times Bob enters a password before he can log on to the site. Describe the probability distribution of X and compute $E[X]$.
b. It turns out that the website has a policy that if a user fails to enter the correct password for k consecutive times, it will delay logging in the user by 2k seconds. For example, if Bob gets the password right the first time, Bob experiences a delay of $2^0 = 1$ second before he is logged on to the website. If Bob gets the password right the second time, he experiences a delay of $2^1 = 2$ seconds before he is logged on to the website, etc. Let Y be the random variable equal to delay time Bob experiences. Describe the probability distribution of Y and compute $E[Y ]$.
I have attempted to solve this problem but seem to lack any understanding of what I am really supposed to do or how to check my work. Is it asking for how many ways I can arrange passwords, or how many times I can get it wrong then right? I feel like its something like $(frac56)(frac16)$ would be him failing the first time and then getting it the second time but im not sure I should be using something quite like that, and how it would affect time.
probability discrete-mathematics probability-distributions
$endgroup$
add a comment |
$begingroup$
Consider Bob, an absent-minded student. Bob has a set of 6 passwords that he uses for all his login needs. He often forgets which password matches with which website so his strategy is to try all of them. Specifically, from his set of passwords he picks one uniformly at random and enters it. If he succeeds – all is well; if he fails – he removes the password from the set and repeats the process.
a. Suppose Bob has to log on to a website he hasn’t used for some time. Define X as the random variable equal to the number of times Bob enters a password before he can log on to the site. Describe the probability distribution of X and compute $E[X]$.
b. It turns out that the website has a policy that if a user fails to enter the correct password for k consecutive times, it will delay logging in the user by 2k seconds. For example, if Bob gets the password right the first time, Bob experiences a delay of $2^0 = 1$ second before he is logged on to the website. If Bob gets the password right the second time, he experiences a delay of $2^1 = 2$ seconds before he is logged on to the website, etc. Let Y be the random variable equal to delay time Bob experiences. Describe the probability distribution of Y and compute $E[Y ]$.
I have attempted to solve this problem but seem to lack any understanding of what I am really supposed to do or how to check my work. Is it asking for how many ways I can arrange passwords, or how many times I can get it wrong then right? I feel like its something like $(frac56)(frac16)$ would be him failing the first time and then getting it the second time but im not sure I should be using something quite like that, and how it would affect time.
probability discrete-mathematics probability-distributions
$endgroup$
Consider Bob, an absent-minded student. Bob has a set of 6 passwords that he uses for all his login needs. He often forgets which password matches with which website so his strategy is to try all of them. Specifically, from his set of passwords he picks one uniformly at random and enters it. If he succeeds – all is well; if he fails – he removes the password from the set and repeats the process.
a. Suppose Bob has to log on to a website he hasn’t used for some time. Define X as the random variable equal to the number of times Bob enters a password before he can log on to the site. Describe the probability distribution of X and compute $E[X]$.
b. It turns out that the website has a policy that if a user fails to enter the correct password for k consecutive times, it will delay logging in the user by 2k seconds. For example, if Bob gets the password right the first time, Bob experiences a delay of $2^0 = 1$ second before he is logged on to the website. If Bob gets the password right the second time, he experiences a delay of $2^1 = 2$ seconds before he is logged on to the website, etc. Let Y be the random variable equal to delay time Bob experiences. Describe the probability distribution of Y and compute $E[Y ]$.
I have attempted to solve this problem but seem to lack any understanding of what I am really supposed to do or how to check my work. Is it asking for how many ways I can arrange passwords, or how many times I can get it wrong then right? I feel like its something like $(frac56)(frac16)$ would be him failing the first time and then getting it the second time but im not sure I should be using something quite like that, and how it would affect time.
probability discrete-mathematics probability-distributions
probability discrete-mathematics probability-distributions
edited Dec 9 '18 at 20:09
Mike Pierce
11.4k103584
11.4k103584
asked Dec 9 '18 at 3:59
STPM222STPM222
1
1
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For part (a), $X in { 1, 2, 3, 4, 5, 6 }$
$P(X = 1) = frac{1}{6}$
$P(X = 2) = (frac{5}{6})(frac{1}{5})= frac{1}{6}$
$P(X = 3) = (frac{5}{6})(frac{4}{5})(frac{1}{4})= frac{1}{6}$
$P(X = 4) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{1}{3})= frac{1}{6}$
$P(X = 5) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})= frac{1}{6}$
$P(X = 6) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})(frac{1}{1})= frac{1}{6}$
$P(X=x) = 0$ for $xnotin {1, 2, 3, 4, 5, 6}$
$E(X) = sum_{x=1}^6 xP(X=x) = 3.5$
For part (b), the delay is 2k seconds which would mean that $Y=2(X-1)$
Since, $X in { 1, 2, 3, 4, 5, 6 }$ this means $Y in {0, 2, 4, 6, 8, 10}$
$P(Y = 0) = P(X=1)=frac{1}{6}$
$P(Y = 2) = P(X=2)=frac{1}{6}$
$P(Y = 4) = P(X=3)=frac{1}{6}$
$P(Y = 6) = P(X=4)=frac{1}{6}$
$P(Y = 8) = P(X=5)=frac{1}{6}$
$P(Y = 10) = P(X=6)=frac{1}{6}$
$P(Y = y) = 0$ for $ynotin {0, 2, 4, 6, 8, 10}$
$E(Y) = E(2(X-1))=2E(X)-2=2(3.5)-2 = 5$
$endgroup$
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031985%2fprobability-and-using-time-with-passwords-and-combinations%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
$begingroup$
For part (a), $X in { 1, 2, 3, 4, 5, 6 }$
$P(X = 1) = frac{1}{6}$
$P(X = 2) = (frac{5}{6})(frac{1}{5})= frac{1}{6}$
$P(X = 3) = (frac{5}{6})(frac{4}{5})(frac{1}{4})= frac{1}{6}$
$P(X = 4) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{1}{3})= frac{1}{6}$
$P(X = 5) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})= frac{1}{6}$
$P(X = 6) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})(frac{1}{1})= frac{1}{6}$
$P(X=x) = 0$ for $xnotin {1, 2, 3, 4, 5, 6}$
$E(X) = sum_{x=1}^6 xP(X=x) = 3.5$
For part (b), the delay is 2k seconds which would mean that $Y=2(X-1)$
Since, $X in { 1, 2, 3, 4, 5, 6 }$ this means $Y in {0, 2, 4, 6, 8, 10}$
$P(Y = 0) = P(X=1)=frac{1}{6}$
$P(Y = 2) = P(X=2)=frac{1}{6}$
$P(Y = 4) = P(X=3)=frac{1}{6}$
$P(Y = 6) = P(X=4)=frac{1}{6}$
$P(Y = 8) = P(X=5)=frac{1}{6}$
$P(Y = 10) = P(X=6)=frac{1}{6}$
$P(Y = y) = 0$ for $ynotin {0, 2, 4, 6, 8, 10}$
$E(Y) = E(2(X-1))=2E(X)-2=2(3.5)-2 = 5$
$endgroup$
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
add a comment |
$begingroup$
For part (a), $X in { 1, 2, 3, 4, 5, 6 }$
$P(X = 1) = frac{1}{6}$
$P(X = 2) = (frac{5}{6})(frac{1}{5})= frac{1}{6}$
$P(X = 3) = (frac{5}{6})(frac{4}{5})(frac{1}{4})= frac{1}{6}$
$P(X = 4) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{1}{3})= frac{1}{6}$
$P(X = 5) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})= frac{1}{6}$
$P(X = 6) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})(frac{1}{1})= frac{1}{6}$
$P(X=x) = 0$ for $xnotin {1, 2, 3, 4, 5, 6}$
$E(X) = sum_{x=1}^6 xP(X=x) = 3.5$
For part (b), the delay is 2k seconds which would mean that $Y=2(X-1)$
Since, $X in { 1, 2, 3, 4, 5, 6 }$ this means $Y in {0, 2, 4, 6, 8, 10}$
$P(Y = 0) = P(X=1)=frac{1}{6}$
$P(Y = 2) = P(X=2)=frac{1}{6}$
$P(Y = 4) = P(X=3)=frac{1}{6}$
$P(Y = 6) = P(X=4)=frac{1}{6}$
$P(Y = 8) = P(X=5)=frac{1}{6}$
$P(Y = 10) = P(X=6)=frac{1}{6}$
$P(Y = y) = 0$ for $ynotin {0, 2, 4, 6, 8, 10}$
$E(Y) = E(2(X-1))=2E(X)-2=2(3.5)-2 = 5$
$endgroup$
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
add a comment |
$begingroup$
For part (a), $X in { 1, 2, 3, 4, 5, 6 }$
$P(X = 1) = frac{1}{6}$
$P(X = 2) = (frac{5}{6})(frac{1}{5})= frac{1}{6}$
$P(X = 3) = (frac{5}{6})(frac{4}{5})(frac{1}{4})= frac{1}{6}$
$P(X = 4) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{1}{3})= frac{1}{6}$
$P(X = 5) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})= frac{1}{6}$
$P(X = 6) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})(frac{1}{1})= frac{1}{6}$
$P(X=x) = 0$ for $xnotin {1, 2, 3, 4, 5, 6}$
$E(X) = sum_{x=1}^6 xP(X=x) = 3.5$
For part (b), the delay is 2k seconds which would mean that $Y=2(X-1)$
Since, $X in { 1, 2, 3, 4, 5, 6 }$ this means $Y in {0, 2, 4, 6, 8, 10}$
$P(Y = 0) = P(X=1)=frac{1}{6}$
$P(Y = 2) = P(X=2)=frac{1}{6}$
$P(Y = 4) = P(X=3)=frac{1}{6}$
$P(Y = 6) = P(X=4)=frac{1}{6}$
$P(Y = 8) = P(X=5)=frac{1}{6}$
$P(Y = 10) = P(X=6)=frac{1}{6}$
$P(Y = y) = 0$ for $ynotin {0, 2, 4, 6, 8, 10}$
$E(Y) = E(2(X-1))=2E(X)-2=2(3.5)-2 = 5$
$endgroup$
For part (a), $X in { 1, 2, 3, 4, 5, 6 }$
$P(X = 1) = frac{1}{6}$
$P(X = 2) = (frac{5}{6})(frac{1}{5})= frac{1}{6}$
$P(X = 3) = (frac{5}{6})(frac{4}{5})(frac{1}{4})= frac{1}{6}$
$P(X = 4) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{1}{3})= frac{1}{6}$
$P(X = 5) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})= frac{1}{6}$
$P(X = 6) = (frac{5}{6})(frac{4}{5})(frac{3}{4})(frac{2}{3})(frac{1}{2})(frac{1}{1})= frac{1}{6}$
$P(X=x) = 0$ for $xnotin {1, 2, 3, 4, 5, 6}$
$E(X) = sum_{x=1}^6 xP(X=x) = 3.5$
For part (b), the delay is 2k seconds which would mean that $Y=2(X-1)$
Since, $X in { 1, 2, 3, 4, 5, 6 }$ this means $Y in {0, 2, 4, 6, 8, 10}$
$P(Y = 0) = P(X=1)=frac{1}{6}$
$P(Y = 2) = P(X=2)=frac{1}{6}$
$P(Y = 4) = P(X=3)=frac{1}{6}$
$P(Y = 6) = P(X=4)=frac{1}{6}$
$P(Y = 8) = P(X=5)=frac{1}{6}$
$P(Y = 10) = P(X=6)=frac{1}{6}$
$P(Y = y) = 0$ for $ynotin {0, 2, 4, 6, 8, 10}$
$E(Y) = E(2(X-1))=2E(X)-2=2(3.5)-2 = 5$
edited Dec 9 '18 at 16:46
answered Dec 9 '18 at 5:27
user137481user137481
1,80021021
1,80021021
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
add a comment |
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I meant to do 2^k not 2k sorry, but I tried to workout what that would be and I got to 10.5 as expected because 1(1/6) + 2(1/6) + 4(1/6) + 8(1/6) + 16(1/6) + 32(1/6) = 10.5..... does this seem like the right way to solve it? @N.F.Taussig
$endgroup$
– STPM222
Dec 9 '18 at 21:04
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
I tried to do it like how I just said @user137481
$endgroup$
– STPM222
Dec 9 '18 at 21:05
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
$begingroup$
@STPM222 Yes, if you meant $2^k$ then $E(Y) = 10.5$
$endgroup$
– user137481
Dec 10 '18 at 3:16
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031985%2fprobability-and-using-time-with-passwords-and-combinations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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