wu :: forums (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
riddles >> putnam exam (pure math) >> Pulling Names Out Of A Hat
(Message started by: ThudanBlunder on Jan 21st, 2009, 5:57pm)

Title: Pulling Names Out Of A Hat
Post by ThudanBlunder on Jan 21st, 2009, 5:57pm
Each year n couples meet for a Christmas party and to exchange gifts. Each of the 2n people write their name on a piece of paper and put it into a hat. They then take turns pulling names out of the hat and give their gift to the person whose name they drew. But if anyone chooses either their own name or the name of their partner, everyone puts the name they drew back into the hat and draws again.  

a) How many different permissible ways of choosing the 2n names are there?  

b) What is the expected number of attempts required?

Title: Re: Pulling Names Out Of A Hat
Post by balakrishnan on Jan 30th, 2009, 10:52am
This is similar to this (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_medium;action=display;num=1232505178)
I won't spoil the fun by giving the answer. The expected number is just the inverse of the probability.



Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board