Probability Theory - $0$ doesn't appear among $k$ digits chosen randomly?
$begingroup$
What’s the probability that $0$ doesn’t appear among $k$ digits
chosen independently and uniformly at random?
My thinking is that the sample space should be something, say $x$, to the power of $k$ and the event that $0$ doesn't appear is $x-1$ to the power $k$. I am not sure if this is the correct way to think about this. And what the '$x$' should be here.
I saw a solution which says it should be $9^k / 10^k$. But I did not understand how this is.
It would be great if I could get an explanation for this.
probability probability-theory
$endgroup$
add a comment |
$begingroup$
What’s the probability that $0$ doesn’t appear among $k$ digits
chosen independently and uniformly at random?
My thinking is that the sample space should be something, say $x$, to the power of $k$ and the event that $0$ doesn't appear is $x-1$ to the power $k$. I am not sure if this is the correct way to think about this. And what the '$x$' should be here.
I saw a solution which says it should be $9^k / 10^k$. But I did not understand how this is.
It would be great if I could get an explanation for this.
probability probability-theory
$endgroup$
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14
add a comment |
$begingroup$
What’s the probability that $0$ doesn’t appear among $k$ digits
chosen independently and uniformly at random?
My thinking is that the sample space should be something, say $x$, to the power of $k$ and the event that $0$ doesn't appear is $x-1$ to the power $k$. I am not sure if this is the correct way to think about this. And what the '$x$' should be here.
I saw a solution which says it should be $9^k / 10^k$. But I did not understand how this is.
It would be great if I could get an explanation for this.
probability probability-theory
$endgroup$
What’s the probability that $0$ doesn’t appear among $k$ digits
chosen independently and uniformly at random?
My thinking is that the sample space should be something, say $x$, to the power of $k$ and the event that $0$ doesn't appear is $x-1$ to the power $k$. I am not sure if this is the correct way to think about this. And what the '$x$' should be here.
I saw a solution which says it should be $9^k / 10^k$. But I did not understand how this is.
It would be great if I could get an explanation for this.
probability probability-theory
probability probability-theory
edited Dec 15 '18 at 3:41
Tianlalu
3,08121038
3,08121038
asked Dec 15 '18 at 3:11
jjPotterjjPotter
32
32
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14
add a comment |
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Assuming we're working in base ten, the digits in question are $0, 1, 2, ..., 9$.
Suppose we take a group of $k$ digits, $d_1,d_2,d_3,d_4,...,d_k$.
What is the probability that $d_1 neq 0$? There are $10$ possible digits, and only $1$ is $0$. Thus, $P(d_1 neq 0) = 9/10$.
Similarly, you can say the same for $d_2, d_3, d_4$, and so on: the rationale is the same.
The probability any $d_i$ having a certain value is independent from that of any other $d_j, ineq j$ as well. Thus, the probability of each being nonzero is multiplied together, since they're independent. Thus, for example,
$$P(d_1,d_2 neq 0) = 9/10 cdot 9/10 = (9/10)^2$$
$$P(d_1,d_2,d_3,d_4 neq 0) = 9/10 cdot 9/10 cdot 9/10 cdot 9/10 = (9/10)^4$$
The pattern should then be clear:
$$P(d_1, d_2, ..., d_k neq 0) = (9/10)^k = 9^k/10^k$$
$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%2f3040130%2fprobability-theory-0-doesnt-appear-among-k-digits-chosen-randomly%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$
Assuming we're working in base ten, the digits in question are $0, 1, 2, ..., 9$.
Suppose we take a group of $k$ digits, $d_1,d_2,d_3,d_4,...,d_k$.
What is the probability that $d_1 neq 0$? There are $10$ possible digits, and only $1$ is $0$. Thus, $P(d_1 neq 0) = 9/10$.
Similarly, you can say the same for $d_2, d_3, d_4$, and so on: the rationale is the same.
The probability any $d_i$ having a certain value is independent from that of any other $d_j, ineq j$ as well. Thus, the probability of each being nonzero is multiplied together, since they're independent. Thus, for example,
$$P(d_1,d_2 neq 0) = 9/10 cdot 9/10 = (9/10)^2$$
$$P(d_1,d_2,d_3,d_4 neq 0) = 9/10 cdot 9/10 cdot 9/10 cdot 9/10 = (9/10)^4$$
The pattern should then be clear:
$$P(d_1, d_2, ..., d_k neq 0) = (9/10)^k = 9^k/10^k$$
$endgroup$
add a comment |
$begingroup$
Assuming we're working in base ten, the digits in question are $0, 1, 2, ..., 9$.
Suppose we take a group of $k$ digits, $d_1,d_2,d_3,d_4,...,d_k$.
What is the probability that $d_1 neq 0$? There are $10$ possible digits, and only $1$ is $0$. Thus, $P(d_1 neq 0) = 9/10$.
Similarly, you can say the same for $d_2, d_3, d_4$, and so on: the rationale is the same.
The probability any $d_i$ having a certain value is independent from that of any other $d_j, ineq j$ as well. Thus, the probability of each being nonzero is multiplied together, since they're independent. Thus, for example,
$$P(d_1,d_2 neq 0) = 9/10 cdot 9/10 = (9/10)^2$$
$$P(d_1,d_2,d_3,d_4 neq 0) = 9/10 cdot 9/10 cdot 9/10 cdot 9/10 = (9/10)^4$$
The pattern should then be clear:
$$P(d_1, d_2, ..., d_k neq 0) = (9/10)^k = 9^k/10^k$$
$endgroup$
add a comment |
$begingroup$
Assuming we're working in base ten, the digits in question are $0, 1, 2, ..., 9$.
Suppose we take a group of $k$ digits, $d_1,d_2,d_3,d_4,...,d_k$.
What is the probability that $d_1 neq 0$? There are $10$ possible digits, and only $1$ is $0$. Thus, $P(d_1 neq 0) = 9/10$.
Similarly, you can say the same for $d_2, d_3, d_4$, and so on: the rationale is the same.
The probability any $d_i$ having a certain value is independent from that of any other $d_j, ineq j$ as well. Thus, the probability of each being nonzero is multiplied together, since they're independent. Thus, for example,
$$P(d_1,d_2 neq 0) = 9/10 cdot 9/10 = (9/10)^2$$
$$P(d_1,d_2,d_3,d_4 neq 0) = 9/10 cdot 9/10 cdot 9/10 cdot 9/10 = (9/10)^4$$
The pattern should then be clear:
$$P(d_1, d_2, ..., d_k neq 0) = (9/10)^k = 9^k/10^k$$
$endgroup$
Assuming we're working in base ten, the digits in question are $0, 1, 2, ..., 9$.
Suppose we take a group of $k$ digits, $d_1,d_2,d_3,d_4,...,d_k$.
What is the probability that $d_1 neq 0$? There are $10$ possible digits, and only $1$ is $0$. Thus, $P(d_1 neq 0) = 9/10$.
Similarly, you can say the same for $d_2, d_3, d_4$, and so on: the rationale is the same.
The probability any $d_i$ having a certain value is independent from that of any other $d_j, ineq j$ as well. Thus, the probability of each being nonzero is multiplied together, since they're independent. Thus, for example,
$$P(d_1,d_2 neq 0) = 9/10 cdot 9/10 = (9/10)^2$$
$$P(d_1,d_2,d_3,d_4 neq 0) = 9/10 cdot 9/10 cdot 9/10 cdot 9/10 = (9/10)^4$$
The pattern should then be clear:
$$P(d_1, d_2, ..., d_k neq 0) = (9/10)^k = 9^k/10^k$$
answered Dec 15 '18 at 3:18
Eevee TrainerEevee Trainer
5,4431936
5,4431936
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%2f3040130%2fprobability-theory-0-doesnt-appear-among-k-digits-chosen-randomly%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
$begingroup$
There are $9$ non-zero digits. The number of ways of selecting $k$ non-zero digits is then $9times 9times cdots times 9 = 9^k$, seen by rule of product. Similarly, there are $10$ digits and the number of ways of selecting $k$ digits is $10times 10times cdots times 10=10^k$. Noting that each selection is equally likely to occur we have that taking the ratio of these gives the probability.
$endgroup$
– JMoravitz
Dec 15 '18 at 3:14