Giving out my pin 2 digits at a time…
If I have a 4 digit pin and, every time I phone an organisation, they ask for 2 of those digits, what is the probability they have my complete PIN after 3 or 4 calls?
For "my security" I would also like to assume that they can't ask for the same two digits two calls in a row (in case I was overheard on call 1).
Over two calls I think this is 6(no of ways to give out complete pin) / 8 (no of 2 digit combinations) x 7 (no of 2 digit combinations with no repeat).
So the bit I am struggling with is working out the no of ways to give out a complete PIN over 3 or 4 calls.
probability
New contributor
add a comment |
If I have a 4 digit pin and, every time I phone an organisation, they ask for 2 of those digits, what is the probability they have my complete PIN after 3 or 4 calls?
For "my security" I would also like to assume that they can't ask for the same two digits two calls in a row (in case I was overheard on call 1).
Over two calls I think this is 6(no of ways to give out complete pin) / 8 (no of 2 digit combinations) x 7 (no of 2 digit combinations with no repeat).
So the bit I am struggling with is working out the no of ways to give out a complete PIN over 3 or 4 calls.
probability
New contributor
add a comment |
If I have a 4 digit pin and, every time I phone an organisation, they ask for 2 of those digits, what is the probability they have my complete PIN after 3 or 4 calls?
For "my security" I would also like to assume that they can't ask for the same two digits two calls in a row (in case I was overheard on call 1).
Over two calls I think this is 6(no of ways to give out complete pin) / 8 (no of 2 digit combinations) x 7 (no of 2 digit combinations with no repeat).
So the bit I am struggling with is working out the no of ways to give out a complete PIN over 3 or 4 calls.
probability
New contributor
If I have a 4 digit pin and, every time I phone an organisation, they ask for 2 of those digits, what is the probability they have my complete PIN after 3 or 4 calls?
For "my security" I would also like to assume that they can't ask for the same two digits two calls in a row (in case I was overheard on call 1).
Over two calls I think this is 6(no of ways to give out complete pin) / 8 (no of 2 digit combinations) x 7 (no of 2 digit combinations with no repeat).
So the bit I am struggling with is working out the no of ways to give out a complete PIN over 3 or 4 calls.
probability
probability
New contributor
New contributor
New contributor
asked Jan 4 at 14:57
James StubbsJames Stubbs
31
31
New contributor
New contributor
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
You might as well assume they ask for the first two digits on the first call. They get the whole PIN in two calls if they ask for the last two on the second call, which is one choice. There are ${4 choose 2}-1=5$ pairs of digits they can ask for on the second call because they cannot ask for the first pair again, so the chance on two calls is $frac 15$.
To get the PIN specifically on the third call, the first gets digits $1$ and $2$, the second must repeat one of $1$ and $2$ and give one more, which might as well be $3$. That is a chance of $frac 45$. Then they must get the fourth digit on the next request, which is chance $frac 35$ as one combination missing the fourth digit is not allowed. The chance is then $frac 45 cdot frac 35=frac {12}{25}.$ The chance of getting the whole PIN by the third request is then $frac 15 + frac {12}{25}=frac {17}{25}. $
I leave the four request case to you.
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
});
}
});
James Stubbs is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3061730%2fgiving-out-my-pin-2-digits-at-a-time%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
You might as well assume they ask for the first two digits on the first call. They get the whole PIN in two calls if they ask for the last two on the second call, which is one choice. There are ${4 choose 2}-1=5$ pairs of digits they can ask for on the second call because they cannot ask for the first pair again, so the chance on two calls is $frac 15$.
To get the PIN specifically on the third call, the first gets digits $1$ and $2$, the second must repeat one of $1$ and $2$ and give one more, which might as well be $3$. That is a chance of $frac 45$. Then they must get the fourth digit on the next request, which is chance $frac 35$ as one combination missing the fourth digit is not allowed. The chance is then $frac 45 cdot frac 35=frac {12}{25}.$ The chance of getting the whole PIN by the third request is then $frac 15 + frac {12}{25}=frac {17}{25}. $
I leave the four request case to you.
add a comment |
You might as well assume they ask for the first two digits on the first call. They get the whole PIN in two calls if they ask for the last two on the second call, which is one choice. There are ${4 choose 2}-1=5$ pairs of digits they can ask for on the second call because they cannot ask for the first pair again, so the chance on two calls is $frac 15$.
To get the PIN specifically on the third call, the first gets digits $1$ and $2$, the second must repeat one of $1$ and $2$ and give one more, which might as well be $3$. That is a chance of $frac 45$. Then they must get the fourth digit on the next request, which is chance $frac 35$ as one combination missing the fourth digit is not allowed. The chance is then $frac 45 cdot frac 35=frac {12}{25}.$ The chance of getting the whole PIN by the third request is then $frac 15 + frac {12}{25}=frac {17}{25}. $
I leave the four request case to you.
add a comment |
You might as well assume they ask for the first two digits on the first call. They get the whole PIN in two calls if they ask for the last two on the second call, which is one choice. There are ${4 choose 2}-1=5$ pairs of digits they can ask for on the second call because they cannot ask for the first pair again, so the chance on two calls is $frac 15$.
To get the PIN specifically on the third call, the first gets digits $1$ and $2$, the second must repeat one of $1$ and $2$ and give one more, which might as well be $3$. That is a chance of $frac 45$. Then they must get the fourth digit on the next request, which is chance $frac 35$ as one combination missing the fourth digit is not allowed. The chance is then $frac 45 cdot frac 35=frac {12}{25}.$ The chance of getting the whole PIN by the third request is then $frac 15 + frac {12}{25}=frac {17}{25}. $
I leave the four request case to you.
You might as well assume they ask for the first two digits on the first call. They get the whole PIN in two calls if they ask for the last two on the second call, which is one choice. There are ${4 choose 2}-1=5$ pairs of digits they can ask for on the second call because they cannot ask for the first pair again, so the chance on two calls is $frac 15$.
To get the PIN specifically on the third call, the first gets digits $1$ and $2$, the second must repeat one of $1$ and $2$ and give one more, which might as well be $3$. That is a chance of $frac 45$. Then they must get the fourth digit on the next request, which is chance $frac 35$ as one combination missing the fourth digit is not allowed. The chance is then $frac 45 cdot frac 35=frac {12}{25}.$ The chance of getting the whole PIN by the third request is then $frac 15 + frac {12}{25}=frac {17}{25}. $
I leave the four request case to you.
answered Jan 4 at 15:08
Ross MillikanRoss Millikan
292k23197371
292k23197371
add a comment |
add a comment |
James Stubbs is a new contributor. Be nice, and check out our Code of Conduct.
James Stubbs is a new contributor. Be nice, and check out our Code of Conduct.
James Stubbs is a new contributor. Be nice, and check out our Code of Conduct.
James Stubbs 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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3061730%2fgiving-out-my-pin-2-digits-at-a-time%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