Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!decvax!harpo!floyd!whuxlb!pyuxll!eisx!npoiv!npois!hogpc!houxm!ihnp4!ixn5c!inuxc!pur-ee!ecn-ec:ecn-pc:ecn-ed:vu
From: ecn-ec:ecn-pc:ecn-ed:vu@pur-ee.UUCP
Newsgroups: net.math
Subject: Yet another envelope stuffing problem.
Message-ID: <179@ecn-ed.UUCP>
Date: Mon, 29-Aug-83 17:54:20 EDT
Article-I.D.: ecn-ed.179
Posted: Mon Aug 29 17:54:20 1983
Date-Received: Tue, 30-Aug-83 14:35:52 EDT
Lines: 17


	I read this problem sometime last year. Probably it was some old
problem from some old contest (W. L. Putnam Comp, or USSR olympiad, or
the International Math Olympiad).

	A secretary wrote n letters and addressed n envelopes. Calculate
the probability that she got p ( 0 <= p <= n ) letters in the right
envelopes if she stuffed them randomly.


	Please mail answers, comments, flames, references, anything, ...
to pur-ee!norris since my current account pur-ee!vu will be terminated
soon. In the meantime, I will make another raid in the library to find the
original problem.

	Hao-Nhien Vu.
	Purdue U.