Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Replies: 6   Last Post: Aug 10, 2013 11:20 PM

 Messages: [ Previous | Next ]
 Jerry Grossman Posts: 27 Registered: 12/6/04
Posted: Nov 24, 2004 7:49 AM

This problem has been floating around for a few years. I heard
it from Gary Thompson, Grove City College (Pennsylvania).
I don't think anyone has the general solution (with n people).
You can use a computer to brute force your way to the answer
for small values of n. In particular, the answer for n=10 is

If anyone has any information about solutions, I'd very much

Jerry Grossman
Oakland University

---- Original message ----
&gt;Date: 23 Nov 04 20:51:41 -0500 (EST)
&gt;From: John &lt;sternitj@uwplatt.edu&gt;
&gt;To: discretemath@mathforum.org
&gt;
&gt;Ten friends organize a gift exchange. The ten names are put in a hat,
&gt;and the first person draws one. If they pick their own name, they
&gt;return it to the bag and draw again, until they have a name that is
&gt;not their own. Then the second person draws, again returning their
&gt;own name if they draw it. This continues down the line. What is the
&gt;probability that when the 10th person draws, only their own name will
&gt;be left in the bag?
&gt;
&gt;Any help!!!
--
Jerrold W. Grossman, Professor
Department of Mathematics and Statistics
346 SEB
Oakland University
Rochester, MI 48309-4485
248-370-3443 (voice)
248-370-4184 (fax)
grossman@oakland.edu
<a href="http://personalwebs.oakland.edu/~grossman/">http://personalwebs.oakland.edu/~grossman/</a>

Date Subject Author
11/23/04 John
11/24/04 Jerry Grossman