All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Open, Sesame! (Posted on 2014-10-14)
There are n keys in the bundle, but only one fits the door's lock.
Trying them one after another, until the right one will be found, what is the probability it will happen on the kth trial?

 No Solution Yet Submitted by Ady TZIDON No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: If the key fits ... (spoiler) | Comment 2 of 3 |
(In reply to If the key fits ... (spoiler) by Steve Herman)

I've never really understood this kind of problem; however if the keys are tried one after another, then on the kth trial (k-1) keys would already have been eliminated, wouldn't they, leaving (n-(k-1)) keys?

So the probability of success on that attempt would be 1/(n-k+1)), giving a probability of 1 if the key is the last in the bundle to be tested.

 Posted by broll on 2014-10-15 08:50:42

 Search: Search body:
Forums (0)