Grinstead-Snell-Probability · Problem 4.1.61

Conditional Probability

Mathematics · attraction-partition

Problem

Prove that if B1,B2,…,BnB_1, B_2, \ldots, B_n are mutually disjoint and collectively exhaustive, and if AA attracts some BiB_i, then AA must repel some BjB_j.

Browse the problem library