Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Best sites for teachers
Sites for teachers
Sites for parents
Terms of use
Awards

Interactive Activities
CTK Exchange
CTK Insights - a blog

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Reciprocal links
Privacy Policy

Guest book
News sites

Recommend this site

Best sites for teachers
Sites for teachers
Sites for parents

Education & Parenting

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

Diminishing Hopes

A fellow's desk sports 8 drawers, where he randomly (but with equal probabilities) stores his documents. This would be the whole condition of the problem, except that in 2 out of 10 cases the fellow simply forgets to store a document, and eventually the latter gets lost.

When the fellow needs a document he starts a search from the first drawer and proceeds sequentially until the document is found or it becomes clear (after checking all the drawers) that the document has not been stored in the desk in the first place.

There are several questions:

  1. The fellow checked and found no documents in the first drawer. What is the probability that the document will be found in the remaining seven drawers?
  2. The fellow checked and found no documents in the first four drawers. What is the probability that the document will be found in the remaining four drawers?
  3. The fellow checked and found no documents in the first seven drawers. What is the probability that the document will be found in the last remaining drawer?

Answers

Solution

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

The answers to the three questions are 7/9, 2/3 and 1/3, respectively. The result may be surprising. Chances of locating the document decrease with every checked drawer. The general formula for the probability of finding the document after unsuccessfully checking n drawers is Pn = (8 - n)/(10 - n). This is a decreasing function of n for n < 10. You can check the solution.

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

Let's add two imaginary drawers to the desk and assume that this is where the documents get lost. We may even think of them as being locked during a search.

With K drawers to go, of which two are unavailable, the probability of a successful outcome is (K - 2)/K. With K = 10 - n, this reduces to Pn = (8 - n)/(10 - n). This is a decreasing function of n for n < 10.

Another curiosity: if we only ask about the probability of finding the document in the next available drawer (after checking the first n drawers), the probability will be Qn = 1/(10 - n), an increasing function of n for n < 10.

References

  1. Ruma Falk, Understanding Probability and Statistics, A K Peters, 1993

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

28680651Page copy protected against web site content infringement by Copyscape


Search:
Keywords:


Latest on CTK Exchange
Math
Posted by Laura
2 messages
06:56 AM, Apr-15-08

Divisibility rules - Jargon buste ...
Posted by Carolyn
2 messages
08:35 AM, Apr-04-08

drawing puzzle
Posted by martin gran
31 messages
06:53 PM, May-09-08

Distance to the horizon
Posted by Monty
3 messages
04:38 PM, May-08-08

Mistake on the page (an aside, Be ...
Posted by Max
4 messages
10:28 AM, Feb-28-08

Nim Games - a query
Posted by Akash Kumar
1 messages
08:53 AM, Apr-15-08

A typo in
Posted by alexwajn
1 messages
11:36 PM, Apr-19-08