Math 230 Final exam Fall 1998 Solutions

1. Let T = the set of students who do have a big screen TV
Let NT = the set of students who do not have a big screen TV
Then tex2html_wrap_inline660

2. Since A and B are independent tex2html_wrap_inline666. Also, then tex2html_wrap_inline668

Since tex2html_wrap_inline670, tex2html_wrap_inline672. By drawing the Venn diagram, it can be seen that tex2html_wrap_inline674, so tex2html_wrap_inline676 tex2html_wrap_inline678
= Pr(C| A)Pr(A) + Pr(C|B)Pr(B) tex2html_wrap_inline682 tex2html_wrap_inline684.

So tex2html_wrap_inline686 AND tex2html_wrap_inline688

3.
tex2html_wrap_inline690
tex2html_wrap_inline692 tex2html_wrap_inline694

4. 12 eggs = 10 good + 2 rotten. When you pick 4 eggs, you can pick all good eggs, 1 bad and 3 good, or 2 good and 2 bad. There are no other choices because there are only 2 bad eggs. Let X = the number of rotten eggs. So the possible values of the random variable X are 0, 1, and 2.

tex2html_wrap580 Also, tex2html_wrap_inline700

5. n = 1,000,000, tex2html_wrap_inline704, tex2html_wrap_inline706
a) tex2html_wrap_inline708
b)tex2html_wrap_inline710
c) tex2html_wrap_inline712
d) tex2html_wrap_inline714

6. (a) Using matrix inverse. If tex2html_wrap581 then find tex2html_wrap_inline716

tex2html_wrap582 tex2html_wrap_inline718 tex2html_wrap583 tex2html_wrap_inline720 tex2html_wrap584

tex2html_wrap_inline722 tex2html_wrap585 tex2html_wrap_inline724 tex2html_wrap586

So tex2html_wrap587

Since tex2html_wrap588

tex2html_wrap589

So x = 4 and y = -2.

(b) (using augmented matrix)

tex2html_wrap590 tex2html_wrap_inline726 tex2html_wrap591 tex2html_wrap_inline720 tex2html_wrap592 tex2html_wrap_inline730
tex2html_wrap593 tex2html_wrap_inline732 tex2html_wrap594

So, x = 2 and y = 4.

7. (i) Transition diagram: (Four states)

Transition matrix: tex2html_wrap595


(ii)

tex2html_wrap596 So tex2html_wrap597 and tex2html_wrap598

tex2html_wrap_inline734 = tex2html_wrap599 = tex2html_wrap600
tex2html_wrap601

(iii) (BONUS) tex2html_wrap602
So the probability of getting two 3's (state 2) is tex2html_wrap_inline736, since the starting state is state 4.

8. (a) Since each row of the transition matrix of a Markov chain must add to 1, tex2html_wrap_inline738 so tex2html_wrap_inline740 and tex2html_wrap_inline742 so tex2html_wrap_inline744.

(b) Let tex2html_wrap603.

We want to find tex2html_wrap604 so that tex2html_wrap605

We get tex2html_wrap_inline746 tex2html_wrap_inline748 tex2html_wrap_inline750 and tex2html_wrap_inline752 tex2html_wrap_inline748 tex2html_wrap_inline756 . Also, we know that tex2html_wrap_inline758.

Solving for tex2html_wrap_inline760 and tex2html_wrap_inline762 using matrices
tex2html_wrap606 tex2html_wrap_inline726 tex2html_wrap_inline766 tex2html_wrap607 tex2html_wrap_inline720 tex2html_wrap608 tex2html_wrap_inline770 tex2html_wrap609 tex2html_wrap_inline724 tex2html_wrap610

So tex2html_wrap_inline774 and tex2html_wrap_inline776

9.
tex2html_wrap_inline778 tex2html_wrap_inline780 x + y + s = 20
tex2html_wrap_inline784 tex2html_wrap_inline780 2x + y + t = 20
tex2html_wrap_inline790 tex2html_wrap_inline792 (slack)

maximize y-x tex2html_wrap_inline780 f + x - y = 0

tex2html_wrap611 tex2html_wrap_inline800 tex2html_wrap_inline802 tex2html_wrap612

No more negatives, STOP! So, y=20, x=0, f=20The maximum value of y - x is 20.

10.
x +y = 15 tex2html_wrap_inline780 x + y + a = 20
tex2html_wrap_inline816 tex2html_wrap_inline780 y -2x + s = 0
tex2html_wrap_inline790 tex2html_wrap_inline824 ( a surplus, s slack)

maximize y tex2html_wrap_inline828 y - Ma tex2html_wrap_inline780 f - y + Ma= 0
Let M = 100

tex2html_wrap613 tex2html_wrap_inline838 tex2html_wrap614
tex2html_wrap_inline724 tex2html_wrap_inline842 tex2html_wrap615

tex2html_wrap_inline844 tex2html_wrap616
tex2html_wrap_inline846 tex2html_wrap_inline848 tex2html_wrap617
No more negatives, so STOP! x = 5, y= 10 and f = 10. So the maximum value of y is 10.



previous

Author: Rebecca Sullivan
Fri Feb 5 19:11:39 EST 1999