This preview shows pages 1–2. Sign up to view the full content.
Steven Weber
Dept. of ECE
Drexel University
ENGR 361: Statistical Analysis of Engineering Systems (Spring, 2008)
Recitation 3 Solutions (Friday, April 18)
Question 1.
Consider the problem of the king, the prisoner, and the jewel, as discussed in class. Instead of
3 chests, suppose there are
n
chests. There are
k
(
1
≤
k
≤
n

1
) jewels found in the chests, and death warrants
in the remaining
n

k
chests. The prisoner selects one of the
n
chests, the king then reveals the contents of
m
(
1
≤
m
≤
n

k

1
) of the chests with death warrants not selected by the prisoner. The prisoner then elects to stay
or switch. Staying means the prisoner is given the contents of the chest she selected. Switching means the prisoner
is allowed to select a chest diﬀerent from the ﬁrst selection, and is given the contents of that selected chest. Note
the probability the prisoner wins a jewel if she doesn’t switch is
k/n
.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '04
 Eisenstein

Click to edit the document details