How many 4 digit pins on set {0-9}
$begingroup$
A password can be any 4 digit {0...9}.
1.)How many possible passwords are there?
for this I did $10^4 = 10,000$
2.) How many possible passwords with no repeated digits?
$10*9*8*7 = 5040$
3.) How many possible passwords are there with repeated digits?
For this do I just subtract 10,000-5040?
Edit: typos. Thanks everyone.
combinatorics permutations
$endgroup$
add a comment |
$begingroup$
A password can be any 4 digit {0...9}.
1.)How many possible passwords are there?
for this I did $10^4 = 10,000$
2.) How many possible passwords with no repeated digits?
$10*9*8*7 = 5040$
3.) How many possible passwords are there with repeated digits?
For this do I just subtract 10,000-5040?
Edit: typos. Thanks everyone.
combinatorics permutations
$endgroup$
2
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
1
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
1
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10
add a comment |
$begingroup$
A password can be any 4 digit {0...9}.
1.)How many possible passwords are there?
for this I did $10^4 = 10,000$
2.) How many possible passwords with no repeated digits?
$10*9*8*7 = 5040$
3.) How many possible passwords are there with repeated digits?
For this do I just subtract 10,000-5040?
Edit: typos. Thanks everyone.
combinatorics permutations
$endgroup$
A password can be any 4 digit {0...9}.
1.)How many possible passwords are there?
for this I did $10^4 = 10,000$
2.) How many possible passwords with no repeated digits?
$10*9*8*7 = 5040$
3.) How many possible passwords are there with repeated digits?
For this do I just subtract 10,000-5040?
Edit: typos. Thanks everyone.
combinatorics permutations
combinatorics permutations
edited May 24 '16 at 9:47
N. F. Taussig
44.4k93357
44.4k93357
asked May 24 '16 at 2:02
OrangePineappleOrangePineapple
7229
7229
2
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
1
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
1
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10
add a comment |
2
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
1
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
1
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10
2
2
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
1
1
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
1
1
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
community wiki answer so the question can be closed
Your solutions to the first two questions are correct.
Yes, to find the number of passwords with repeated digits, you subtract the number of passwords with no repeated digits from the total, so there are $10000 - 5040 = 4960$, as you found.
$endgroup$
add a comment |
$begingroup$
For question 2, if you don't consider $0$ as a possible digit for the first number (because then it would be a 3 digit number, rather than a 4 digit number), then the answer is $9*9*8*7 = 4536$.
$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%2f1797464%2fhow-many-4-digit-pins-on-set-0-9%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
community wiki answer so the question can be closed
Your solutions to the first two questions are correct.
Yes, to find the number of passwords with repeated digits, you subtract the number of passwords with no repeated digits from the total, so there are $10000 - 5040 = 4960$, as you found.
$endgroup$
add a comment |
$begingroup$
community wiki answer so the question can be closed
Your solutions to the first two questions are correct.
Yes, to find the number of passwords with repeated digits, you subtract the number of passwords with no repeated digits from the total, so there are $10000 - 5040 = 4960$, as you found.
$endgroup$
add a comment |
$begingroup$
community wiki answer so the question can be closed
Your solutions to the first two questions are correct.
Yes, to find the number of passwords with repeated digits, you subtract the number of passwords with no repeated digits from the total, so there are $10000 - 5040 = 4960$, as you found.
$endgroup$
community wiki answer so the question can be closed
Your solutions to the first two questions are correct.
Yes, to find the number of passwords with repeated digits, you subtract the number of passwords with no repeated digits from the total, so there are $10000 - 5040 = 4960$, as you found.
edited Apr 22 '18 at 9:57
community wiki
3 revs, 2 users 88%
N. F. Taussig
add a comment |
add a comment |
$begingroup$
For question 2, if you don't consider $0$ as a possible digit for the first number (because then it would be a 3 digit number, rather than a 4 digit number), then the answer is $9*9*8*7 = 4536$.
$endgroup$
add a comment |
$begingroup$
For question 2, if you don't consider $0$ as a possible digit for the first number (because then it would be a 3 digit number, rather than a 4 digit number), then the answer is $9*9*8*7 = 4536$.
$endgroup$
add a comment |
$begingroup$
For question 2, if you don't consider $0$ as a possible digit for the first number (because then it would be a 3 digit number, rather than a 4 digit number), then the answer is $9*9*8*7 = 4536$.
$endgroup$
For question 2, if you don't consider $0$ as a possible digit for the first number (because then it would be a 3 digit number, rather than a 4 digit number), then the answer is $9*9*8*7 = 4536$.
answered Dec 28 '18 at 19:02
Isopycnal OscillationIsopycnal Oscillation
1155
1155
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%2f1797464%2fhow-many-4-digit-pins-on-set-0-9%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
2
$begingroup$
I think you mean 1 should be $10^{4}$..
$endgroup$
– Mattos
May 24 '16 at 2:06
1
$begingroup$
You are correct. Repeated digits and no repeated digits are mutually exclusive and span the entire set of passwords so what you did works.
$endgroup$
– lordoftheshadows
May 24 '16 at 2:09
1
$begingroup$
Typo. $10^4$. Yes. Pins either have repeated digits or they don't. So REPEAT +NON =ALL so REPEAT = ALL - NON. That's ligical, isn't it? (And yes, other than the typi, you did 1 and 2 perfectly correctly.)
$endgroup$
– fleablood
May 24 '16 at 2:10