Probaility of bruteforcing a four digit lock with and without memory
$begingroup$
I have a problem with a lock. The lock has a four digit code. The numbers span from 0 to 9 so the number of all possible combinations is $10^4$ I have 7200 guesses. And for now I can remember all of the codes I've inputted so far. What is my chance of finding the correct code?
My (probably incorrect) thought was that the chance of getting the correct one goes up after each wrong guess and since I have 7200 of these. I could simply add up an arithmetic sequence like this $frac{7200}{2}cdot(frac{1}{10^4}+frac{1}{(10^4)-7199})$ and get the probability. It equals 0.01285% in this case which just seems wrong.
And also I have the same problem but this time I don't remember which codes I've inputted and need to find out my probability of opening the lock this time.
probability
$endgroup$
add a comment |
$begingroup$
I have a problem with a lock. The lock has a four digit code. The numbers span from 0 to 9 so the number of all possible combinations is $10^4$ I have 7200 guesses. And for now I can remember all of the codes I've inputted so far. What is my chance of finding the correct code?
My (probably incorrect) thought was that the chance of getting the correct one goes up after each wrong guess and since I have 7200 of these. I could simply add up an arithmetic sequence like this $frac{7200}{2}cdot(frac{1}{10^4}+frac{1}{(10^4)-7199})$ and get the probability. It equals 0.01285% in this case which just seems wrong.
And also I have the same problem but this time I don't remember which codes I've inputted and need to find out my probability of opening the lock this time.
probability
$endgroup$
add a comment |
$begingroup$
I have a problem with a lock. The lock has a four digit code. The numbers span from 0 to 9 so the number of all possible combinations is $10^4$ I have 7200 guesses. And for now I can remember all of the codes I've inputted so far. What is my chance of finding the correct code?
My (probably incorrect) thought was that the chance of getting the correct one goes up after each wrong guess and since I have 7200 of these. I could simply add up an arithmetic sequence like this $frac{7200}{2}cdot(frac{1}{10^4}+frac{1}{(10^4)-7199})$ and get the probability. It equals 0.01285% in this case which just seems wrong.
And also I have the same problem but this time I don't remember which codes I've inputted and need to find out my probability of opening the lock this time.
probability
$endgroup$
I have a problem with a lock. The lock has a four digit code. The numbers span from 0 to 9 so the number of all possible combinations is $10^4$ I have 7200 guesses. And for now I can remember all of the codes I've inputted so far. What is my chance of finding the correct code?
My (probably incorrect) thought was that the chance of getting the correct one goes up after each wrong guess and since I have 7200 of these. I could simply add up an arithmetic sequence like this $frac{7200}{2}cdot(frac{1}{10^4}+frac{1}{(10^4)-7199})$ and get the probability. It equals 0.01285% in this case which just seems wrong.
And also I have the same problem but this time I don't remember which codes I've inputted and need to find out my probability of opening the lock this time.
probability
probability
asked Jan 12 at 10:13
LipovlanLipovlan
134
134
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For the first problem:
You are inputting $7200$ different codes. So the probability of one of them being the right code is exactly $$7200/10000=72%$$
For the second problem:
At each attempt, the probability of failure is $9999/10000$. So for $7200$ attempts, the probability of failing each time is $(9999/10000)^{7200}$. So the probability of success is
$$1-(9999/10000)^{7200}approx 51.33%$$
$endgroup$
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%2f3070761%2fprobaility-of-bruteforcing-a-four-digit-lock-with-and-without-memory%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 the first problem:
You are inputting $7200$ different codes. So the probability of one of them being the right code is exactly $$7200/10000=72%$$
For the second problem:
At each attempt, the probability of failure is $9999/10000$. So for $7200$ attempts, the probability of failing each time is $(9999/10000)^{7200}$. So the probability of success is
$$1-(9999/10000)^{7200}approx 51.33%$$
$endgroup$
add a comment |
$begingroup$
For the first problem:
You are inputting $7200$ different codes. So the probability of one of them being the right code is exactly $$7200/10000=72%$$
For the second problem:
At each attempt, the probability of failure is $9999/10000$. So for $7200$ attempts, the probability of failing each time is $(9999/10000)^{7200}$. So the probability of success is
$$1-(9999/10000)^{7200}approx 51.33%$$
$endgroup$
add a comment |
$begingroup$
For the first problem:
You are inputting $7200$ different codes. So the probability of one of them being the right code is exactly $$7200/10000=72%$$
For the second problem:
At each attempt, the probability of failure is $9999/10000$. So for $7200$ attempts, the probability of failing each time is $(9999/10000)^{7200}$. So the probability of success is
$$1-(9999/10000)^{7200}approx 51.33%$$
$endgroup$
For the first problem:
You are inputting $7200$ different codes. So the probability of one of them being the right code is exactly $$7200/10000=72%$$
For the second problem:
At each attempt, the probability of failure is $9999/10000$. So for $7200$ attempts, the probability of failing each time is $(9999/10000)^{7200}$. So the probability of success is
$$1-(9999/10000)^{7200}approx 51.33%$$
edited Jan 12 at 10:32
answered Jan 12 at 10:24


TonyKTonyK
42.6k355134
42.6k355134
add a comment |
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%2f3070761%2fprobaility-of-bruteforcing-a-four-digit-lock-with-and-without-memory%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