Article View: bit.listserv.graph-ti
Article #91Graph-TI - Expectation
From: JohnHanna
Date: Sat, 17 Dec 1994 02:00
Date: Sat, 17 Dec 1994 02:00
35 lines
2071 bytes
2071 bytes
Who can help with the following problem...
SOGGIE, breakfast of chumps, is having a special promotion. They are packing
a special 'prize' in each box of SOGGIES. There are three different prizes in
the collection, distributed uniformly among the boxes, and each box contains
one prize.
You, constant reader, buy one box at a time.
a. What is the probability of getting all three prizes in exactly three
boxes? That is, after buying three boxes, each box contains a different
prize.
b. What is the probability of getting all three prizes in exactly four
boxes?
c. What is the probability of getting all three prizes in exactly K
boxes?
d. What is the average (expected) number of boxes needed to get all
three prizes?
e. If the number of prizes in the collection is N, find a function E(N),
the expected number of boxes required to get all N prizes in the collection.
I've assigned this problem situation to my AP computer science class to
program as a simulation using Pascal 'sets' and they can graph a good
approximation of the function through Monte Carlo methods, but I've not yet
come up with a function E(N). I have determined that
(a) P(3 boxes) for three prizes is 2/9 (that was easy: 1*2/3*1/3)
and
(b) P(4 boxes) for three prizes is 2/7 (by inspecting the outcome space, but
I am stuck even for a formula for (b).
Any insights are always appreciated!
JohnHanna@aol.com
Technical Details
Message-ID:
<941216210058_8182934@aol.com>Path:
arc1-ca.pugleaf.net!bga.com!news.sprintlink.net!howland.reston.ans.net!europa.eng.gtefsd.com!paladin.american.edu!auvm!aol.com!JohnHannaShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 104512,dc77046f6398ec17,start X-Google-Attributes: gid104512,public X-Google-ArrivalTime: 1994-12-16 21:58:24 PST Path: arc1-ca.pugleaf.net!bga.com!news.sprintlink.net!howland.reston.ans.net!europa.eng.gtefsd.com!paladin.american.edu!auvm!aol.com!JohnHanna Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU Newsgroups: bit.listserv.graph-ti Date: Fri, 16 Dec 1994 21:00:59 -0500 From: JohnHanna@aol.com Message-ID: <941216210058_8182934@aol.com> Subject: Graph-TI - Expectation Sender: owner-graph-ti@dsmail.internic.net Precedence: bulk Reply-To: JohnHanna@aol.com Lines: 35