Out of 11 tickets marked with nos. 1 to 11, 3 tickets are drawn at random. Find the probability that the...
$begingroup$
I kinda tried it and got the answer 5/33.
But I feel like I am doing something wrong.
What I did was:.
Firstly I found favorable outcomes. My favourable outcomes were 25 such triplets. I think I am doing something wrong here only.
Then I found total outcomes by C(11,3).
Then I found the probability.
Please anyone correct me if I am wrong.
probability arithmetic-progressions elementary-probability
$endgroup$
add a comment |
$begingroup$
I kinda tried it and got the answer 5/33.
But I feel like I am doing something wrong.
What I did was:.
Firstly I found favorable outcomes. My favourable outcomes were 25 such triplets. I think I am doing something wrong here only.
Then I found total outcomes by C(11,3).
Then I found the probability.
Please anyone correct me if I am wrong.
probability arithmetic-progressions elementary-probability
$endgroup$
$begingroup$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42
add a comment |
$begingroup$
I kinda tried it and got the answer 5/33.
But I feel like I am doing something wrong.
What I did was:.
Firstly I found favorable outcomes. My favourable outcomes were 25 such triplets. I think I am doing something wrong here only.
Then I found total outcomes by C(11,3).
Then I found the probability.
Please anyone correct me if I am wrong.
probability arithmetic-progressions elementary-probability
$endgroup$
I kinda tried it and got the answer 5/33.
But I feel like I am doing something wrong.
What I did was:.
Firstly I found favorable outcomes. My favourable outcomes were 25 such triplets. I think I am doing something wrong here only.
Then I found total outcomes by C(11,3).
Then I found the probability.
Please anyone correct me if I am wrong.
probability arithmetic-progressions elementary-probability
probability arithmetic-progressions elementary-probability
asked Jan 1 at 16:34
GarimaGarima
11
11
$begingroup$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42
add a comment |
$begingroup$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42
$begingroup$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I expect the hard part is making sure you didn't miss some of the progressions. Let's count them by period.
Period $1$: $(1,2,3), (2,3,4), cdots, (9,10,11),$ so $boxed 9$
Period $2$: $(1,3,5), (2,4,6), cdots , (7,9,11),$ so $boxed 7$
Period $3$: $(1,4,7), (2,5,8), cdots, (5,8,11),$ so $boxed 5$
Period $4$: $(1,5,9), (2,6,10), (3, 7,11),$ so $boxed 3$
Period $5$: $(1,6,11),$ so $boxed 1$
Thus there are $1+3+5+7+9=25$ three term progressions. As there are $binom {11}3=165$ ways to choose three with no restriction, the answer is $$frac {25}{165}=boxed {frac 5{33}}$$
Confirming your result.
$endgroup$
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
add a comment |
$begingroup$
There are ${11choose 3}=165$ ways to choose $3$ tickets. If the middle one has number $min[2..6]$ there are $m-1$ favorable triples, and for $m'in[7..10]$ we obtain the same as for $min[2..5]$. It follows that there are
$$2(1+2+3+4)+5=25$$
favorable triples. The requested probability then is $p={25over165}={5over33}$.
$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%2f3058628%2fout-of-11-tickets-marked-with-nos-1-to-11-3-tickets-are-drawn-at-random-find%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$
I expect the hard part is making sure you didn't miss some of the progressions. Let's count them by period.
Period $1$: $(1,2,3), (2,3,4), cdots, (9,10,11),$ so $boxed 9$
Period $2$: $(1,3,5), (2,4,6), cdots , (7,9,11),$ so $boxed 7$
Period $3$: $(1,4,7), (2,5,8), cdots, (5,8,11),$ so $boxed 5$
Period $4$: $(1,5,9), (2,6,10), (3, 7,11),$ so $boxed 3$
Period $5$: $(1,6,11),$ so $boxed 1$
Thus there are $1+3+5+7+9=25$ three term progressions. As there are $binom {11}3=165$ ways to choose three with no restriction, the answer is $$frac {25}{165}=boxed {frac 5{33}}$$
Confirming your result.
$endgroup$
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
add a comment |
$begingroup$
I expect the hard part is making sure you didn't miss some of the progressions. Let's count them by period.
Period $1$: $(1,2,3), (2,3,4), cdots, (9,10,11),$ so $boxed 9$
Period $2$: $(1,3,5), (2,4,6), cdots , (7,9,11),$ so $boxed 7$
Period $3$: $(1,4,7), (2,5,8), cdots, (5,8,11),$ so $boxed 5$
Period $4$: $(1,5,9), (2,6,10), (3, 7,11),$ so $boxed 3$
Period $5$: $(1,6,11),$ so $boxed 1$
Thus there are $1+3+5+7+9=25$ three term progressions. As there are $binom {11}3=165$ ways to choose three with no restriction, the answer is $$frac {25}{165}=boxed {frac 5{33}}$$
Confirming your result.
$endgroup$
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
add a comment |
$begingroup$
I expect the hard part is making sure you didn't miss some of the progressions. Let's count them by period.
Period $1$: $(1,2,3), (2,3,4), cdots, (9,10,11),$ so $boxed 9$
Period $2$: $(1,3,5), (2,4,6), cdots , (7,9,11),$ so $boxed 7$
Period $3$: $(1,4,7), (2,5,8), cdots, (5,8,11),$ so $boxed 5$
Period $4$: $(1,5,9), (2,6,10), (3, 7,11),$ so $boxed 3$
Period $5$: $(1,6,11),$ so $boxed 1$
Thus there are $1+3+5+7+9=25$ three term progressions. As there are $binom {11}3=165$ ways to choose three with no restriction, the answer is $$frac {25}{165}=boxed {frac 5{33}}$$
Confirming your result.
$endgroup$
I expect the hard part is making sure you didn't miss some of the progressions. Let's count them by period.
Period $1$: $(1,2,3), (2,3,4), cdots, (9,10,11),$ so $boxed 9$
Period $2$: $(1,3,5), (2,4,6), cdots , (7,9,11),$ so $boxed 7$
Period $3$: $(1,4,7), (2,5,8), cdots, (5,8,11),$ so $boxed 5$
Period $4$: $(1,5,9), (2,6,10), (3, 7,11),$ so $boxed 3$
Period $5$: $(1,6,11),$ so $boxed 1$
Thus there are $1+3+5+7+9=25$ three term progressions. As there are $binom {11}3=165$ ways to choose three with no restriction, the answer is $$frac {25}{165}=boxed {frac 5{33}}$$
Confirming your result.
edited Jan 1 at 16:47
answered Jan 1 at 16:41
lulululu
42.5k25080
42.5k25080
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
add a comment |
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
$begingroup$
Thank you lulu. You know what it was so much relieving to get the correct answer and to get it confirmed by someone. So thanks again.
$endgroup$
– Garima
Jan 1 at 16:58
add a comment |
$begingroup$
There are ${11choose 3}=165$ ways to choose $3$ tickets. If the middle one has number $min[2..6]$ there are $m-1$ favorable triples, and for $m'in[7..10]$ we obtain the same as for $min[2..5]$. It follows that there are
$$2(1+2+3+4)+5=25$$
favorable triples. The requested probability then is $p={25over165}={5over33}$.
$endgroup$
add a comment |
$begingroup$
There are ${11choose 3}=165$ ways to choose $3$ tickets. If the middle one has number $min[2..6]$ there are $m-1$ favorable triples, and for $m'in[7..10]$ we obtain the same as for $min[2..5]$. It follows that there are
$$2(1+2+3+4)+5=25$$
favorable triples. The requested probability then is $p={25over165}={5over33}$.
$endgroup$
add a comment |
$begingroup$
There are ${11choose 3}=165$ ways to choose $3$ tickets. If the middle one has number $min[2..6]$ there are $m-1$ favorable triples, and for $m'in[7..10]$ we obtain the same as for $min[2..5]$. It follows that there are
$$2(1+2+3+4)+5=25$$
favorable triples. The requested probability then is $p={25over165}={5over33}$.
$endgroup$
There are ${11choose 3}=165$ ways to choose $3$ tickets. If the middle one has number $min[2..6]$ there are $m-1$ favorable triples, and for $m'in[7..10]$ we obtain the same as for $min[2..5]$. It follows that there are
$$2(1+2+3+4)+5=25$$
favorable triples. The requested probability then is $p={25over165}={5over33}$.
answered Jan 1 at 18:20
Christian BlatterChristian Blatter
174k8115327
174k8115327
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%2f3058628%2fout-of-11-tickets-marked-with-nos-1-to-11-3-tickets-are-drawn-at-random-find%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$
I agree with you calculations. I missed one in my earlier comment.
$endgroup$
– saulspatz
Jan 1 at 16:40
$begingroup$
@lulu You just beat me to it.
$endgroup$
– saulspatz
Jan 1 at 16:42