- #1
alman9898
- 10
- 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: