November 2001 - Course 1 SOA Solutions
November 2001 - Course 1 SOA Solutions
November 2001 - Course 1 SOA Solutions
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
21. D<br />
Let N1 and N<br />
2<br />
denote the number of claims during weeks one and two, respectively.<br />
Then since N1 and N<br />
2<br />
are independent,<br />
7<br />
[ N1+ N2 = ] = ∑ [ N1 = n] [ N2<br />
= −n]<br />
n=<br />
0<br />
Pr 7 Pr Pr 7<br />
7 ⎛ 1 ⎞⎛ 1 ⎞<br />
= ∑n=<br />
0⎜ n+ 1⎟⎜ 8−n<br />
⎟<br />
⎝2 ⎠⎝2<br />
⎠<br />
7 1<br />
= ∑n=<br />
0 9<br />
2<br />
8 1 1<br />
= = =<br />
9 6<br />
2 2 64<br />
22. D<br />
The amount of the drug present peaks at the instants an injection is administered. If A(n)<br />
is the amount of the drug remaining in the patient’s body at the time of the nth injection,<br />
then<br />
A 1 = 250<br />
()<br />
−16<br />
( 2) = 250( 1+<br />
e )<br />
A<br />
%<br />
n−1 −k<br />
6<br />
An ( ) = 250∑<br />
e<br />
k = 0<br />
and the least upper bound is<br />
∞ −k<br />
6 250<br />
lim An ( ) = 250∑<br />
e = = 1628 (noting the<br />
n→∞<br />
k = 0<br />
−16<br />
1−<br />
e<br />
−16<br />
series is geometric with ratio e )<br />
<strong>Course</strong> 1 <strong>Solutions</strong> 12 <strong>November</strong> <strong>2001</strong>