The Probability Complement Rule
Every event A splits the sample space in two: outcomes where A happens, and outcomes where it does not. The second group is the complement of A, written A′ (also Ac or Aˉ). Because exactly one of the two must occur, their probabilities together fill the whole space:
P(A)+P(A′)=1⟹P(A′)=1−P(A).
That is the complement rule: the probability that A does not happen is 1 minus the probability that it does.
Why It Holds
A and A′ are mutually exclusive (no outcome lies in both) and exhaustive (together they are the entire sample space S, with P(S)=1). So P(A)+P(A′)=P(S)=1, and rearranging gives the rule.
A Simple Example
For a fair die, P(six)=61, so P(not six)=1−61=65.
Why It Is So Useful: the "At Least One" Trick
Counting "at least one" directly often means adding many separate cases, while its complement, "none," is a single easy case. For instance, the probability of at least one head in three tosses of a fair coin:
P(at least one head)=1−P(no heads)=1−(21)3=1−81=87.
Computing "no heads" once is far quicker than summing the one-head, two-head and three-head cases separately. …