First success, sampling without replacement

  • Thread starter Thread starter alman9898
  • Start date Start date
  • Tags Tags
    Sampling
Click For Summary

Homework Help Overview

The problem involves a scenario where a box contains 5 keys, with only one key capable of opening a lock. Keys are selected and tested sequentially until the correct key is found. The variable Y represents the trial number on which the lock is opened, and the discussion centers around determining the probability function for Y.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the probability function P(Y = i) and express confusion regarding the dependence of trials. Some explore the use of conditional probabilities to derive P(Y=2) and question the relevance of certain formulas. Others seek clarification on the interpretation of their findings and the correct approach to the problem.

Discussion Status

The discussion is ongoing, with participants sharing their thoughts on the probability calculations and expressing confusion about the relationship between the trials. Some guidance has been offered regarding the need to consider the situation one key at a time, but no consensus has been reached on the correct method or formula.

Contextual Notes

Participants note that the problem may involve complexities due to the dependence of trials, and there is uncertainty about the correct interpretation of the probability function. Some participants also mention a potential misunderstanding regarding the nature of the formulas being discussed.

alman9898
Messages
9
Reaction score
0

Homework Statement


A box contains 5 keys, only one of which will open a lock. Keys are randomly selected and tried, one at a time, until the lock is opened (keys that do not work are discarded before another is tried). Let Y be the number of the trial on which the lock is opened. What is the prob function for Y?

Homework Equations


[tex]{{{m \choose k} {{N-m} \choose {n-k}}}\over {N \choose n}}[/tex]

The Attempt at a Solution



What I am trying to find...

P(Y = i) where i is the number of the trial where the "first" (and only) success occurs. This would be much easier if the trials were independent but since they are dependent, I'm having trouble translating the problem into a hypergeometric one. The explanations I"ve found provided online quickly jump to the math without explaining why they did what they did...

What I've tried is C(1,1) * C(4, i-1) / C(5, i) but I know this is wrong because I believe it should turn out that p(i) = 1/5 for all i (based off this http://docs.google.com/gview?a=v&q=cache:_nd2dQm5Me8J:https://www.cs.drexel.edu/classes/ProbStat/mcs311_Spring98/test2ans.pdf+%22a+box+contains+5+keys%22&hl=en&gl=us&sig=AFQjCNHgIMqwTOs-06Phz8C11i5iqKDTlA" I found online), but I can't determine how to proceed...I'm very confused...

Further update: it seems this formula probably describes the cdf rather than the pdf, but I don't know why...I would really appreciate a clear and concise explanation.
 
Last edited by a moderator:
Physics news on Phys.org
Its obvious P(Y=1) = 1/5. To get P(Y=2) two things must happen. You must fail on the first draw and succeed on the second. So you need a conditional probability:

[itex]P(Y=2) = P(Y\ne 1)P(Y=2|Y\ne 1)[/itex]

Can you figure that out and take it from there?
 
So, what exactly did I find when I have

C(1,1)*C(4, i-1)/C(5,i) ... the conditional probability for Y = i ?
 
just a quick question, did you get your answer, because I am dealing with similar problem atm and can't find any help online with it, cheers
 
LCKurtz said:
Its obvious P(Y=1) = 1/5. To get P(Y=2) two things must happen. You must fail on the first draw and succeed on the second. So you need a conditional probability:

[itex]P(Y=2) = P(Y\ne 1)P(Y=2|Y\ne 1)[/itex]

Can you figure that out and take it from there?

alman9898 said:
So, what exactly did I find when I have

C(1,1)*C(4, i-1)/C(5,i) ... the conditional probability for Y = i ?

Somehow I didn't see your answer earlier. I don't know what your forumula represents, but you ignored my question. The answer to my question will lead you to the solution method.
 
alman9898 said:

Homework Statement


A box contains 5 keys, only one of which will open a lock. Keys are randomly selected and tried, one at a time, until the lock is opened (keys that do not work are discarded before another is tried). Let Y be the number of the trial on which the lock is opened. What is the prob function for Y?

Homework Equations


[tex]{{{m \choose k} {{N-m} \choose {n-k}}}\over {N \choose n}}[/tex]

The Attempt at a Solution



What I am trying to find...

P(Y = i) where i is the number of the trial where the "first" (and only) success occurs. This would be much easier if the trials were independent but since they are dependent, I'm having trouble translating the problem into a hypergeometric one. The explanations I"ve found provided online quickly jump to the math without explaining why they did what they did...

What I've tried is C(1,1) * C(4, i-1) / C(5, i) but I know this is wrong because I believe it should turn out that p(i) = 1/5 for all i (based off this http://docs.google.com/gview?a=v&q=cache:_nd2dQm5Me8J:https://www.cs.drexel.edu/classes/ProbStat/mcs311_Spring98/test2ans.pdf+%22a+box+contains+5+keys%22&hl=en&gl=us&sig=AFQjCNHgIMqwTOs-06Phz8C11i5iqKDTlA" I found online), but I can't determine how to proceed...I'm very confused...

Further update: it seems this formula probably describes the cdf rather than the pdf, but I don't know why...I would really appreciate a clear and concise explanation.

Your formula above is the answer to a question completely from the one you are asking about. Rather than writing down random formulas (that may, or may not be relevant), just sit down and consider the situation one key at a time. What is the probability that the first key works? What is the probability that the first key does not work but the second one does? After answering these two questions you should start to see the needed pattern.

RGV
 
Last edited by a moderator:

Similar threads

  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
14
Views
7K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
6K
  • · Replies 4 ·
Replies
4
Views
2K