This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: P ( A [ B ) = P ( A ) + P ( B ). This statement is (a) True. (b) False. Problem 4 The total number of ways of choosing r objects from n objects with replace-ment when order is not important is (a) C n + r ± 1 r . (b) n r . (c) C n r . (d) P n r . Problem 5 Let us recollect that ± denotes the empty set. For every event A (a) P ( A \ ± ) = 0. (b) P ( A \ ± ) = 1. (c) P ( A \ ± ) > 0. (d) P ( A \ ± ) < 0....
View Full Document
- Spring '08