Prove that the probability of occurrence of all of a given set of events A(1) through A(n) is equal to the sum of the individual probabilities minus the sum of the probabilities of all pairs of events, A(i) OR A(j) plus the sum of all triples of events, A(i) OR A(j) OR A(k), ..., plus (-1)^(n-1) times the n-tuple A(i) OR ... OR A(n).

Prove for the specific cases of n = 3 and n = 10, and the general case.

(In reply to re: Done !!!! by Charlie)

So + means add only the parts that aren't already there...

Is there a problem with my algorithm?

Note: I just saw the same post 3 times below... Did anyone else see that?

Posted by Gamer on 2003-03-15 15:58:57