Pick a mode under Calculation Mode: Mutually Independent, Mutually Exclusive, Given P(A∩B∩C), Given P(A∪B∪C) or Given Pairwise Intersections; the boxes below change with it. Learn more about the modes
Type P(A), P(B) and P(C) (0 to 1) and, in the Given modes, the triple intersection or the union and the three pairwise intersections; every box opens with an example value. Learn more about the eight regions
Click Calculate; the eight region rows appear, each with a three-circle sketch, followed by the Additional Probabilities, or a red box lists the axiom violations. Reset restores the example values. Learn more about the sketches
Click a result row to open its step-by-step calculation; click again to close it. Learn more about the steps
Read Event Properties for the two kinds of independence and mutual exclusivity, and the panel on the right for the rule of the current mode. Learn more about the properties
Calculate probabilities for three events A, B, and C with visual Venn diagrams showing all 8 regions and step-by-step solutions.
Input Probabilities
📊
Ready to Calculate
Enter your probabilities and click Calculate to see results
Mutually independent events
Multiplies the three probabilities for every intersection, P(AcapBcapC)=P(A)P(B)P(C) and the pairs likewise, then fills the eight regions and the union. Learn more about mutually independent events
The calculator provides five modes matching different input scenarios for three events A, B, and C. Mutually Independent mode assumes all three events are independent—each event's occurrence doesn't affect the others. Enter only P(A), P(B), and P(C), and the calculator computes all intersections by multiplication: P(A∩B) = P(A)×P(B), P(A∩C) = P(A)×P(C), P(B∩C) = P(B)×P(C), and P(A∩B∩C) = P(A)×P(B)×P(C). Use this mode for completely independent processes like rolling three separate dice.
Mutually Exclusive mode applies when events cannot occur simultaneously—if one happens, the others cannot. This forces all intersections to zero: P(A∩B) = P(A∩C) = P(B∩C) = P(A∩B∩C) = 0. The union simplifies to P(A∪B∪C) = P(A) + P(B) + P(C). Use for non-overlapping outcomes like rolling exactly 1, exactly 2, or exactly 3 on a single die.
Given P(A∩B∩C) mode starts with the triple intersection—all three events occurring together. Provide P(A), P(B), P(C), P(A∩B∩C), and the three pairwise intersections P(A∩B), P(A∩C), P(B∩C). The calculator uses the inclusion-exclusion principle to compute the union and derives all eight Venn diagram regions.
Given P(A∪B∪C) mode starts with the union—at least one event occurring. Provide P(A), P(B), P(C), P(A∪B∪C), and the three pairwise intersections. The calculator solves for P(A∩B∩C) by rearranging inclusion-exclusion: P(A∩B∩C) = P(A) + P(B) + P(C) - P(A∩B) - P(A∩C) - P(B∩C) - P(A∪B∪C).
Given Pairwise Intersections mode provides all three pairwise intersections P(A∩B), P(A∩C), P(B∩C) plus the triple intersection P(A∩B∩C). The calculator computes the union via inclusion-exclusion. This mode suits situations where you know how pairs relate but need overall coverage. The five buttons sit under Calculation Mode at the top of the card, and the boxes change with the choice: P(A), P(B) and P(C) always, then P(A∩B∩C) or P(A∪B∪C) and the three pairwise intersections for the three Given modes. Every box opens with an example value (0.5, 0.4, 0.3; 0.06; 0.82; 0.2, 0.15, 0.12), so Calculate works at once. Each mode has its own section, from Three Mutually Independent Events to Starting from the Pairwise Intersections.
Working with the Eight Venn Diagram Regions
DemoEight regions for the example values, then for disjoint events
Step 0 of 3
Three overlapping circles create eight mutually exclusive regions representing all possible event combinations. The calculator computes probability for each region, partitioning the entire sample space.
Region 1 - P(A∩B∩C): The central region where all three circles overlap. All three events occur simultaneously. For independent events, this equals P(A)×P(B)×P(C).
Region 2 - P(A∩B∩C'): Events A and B occur but C doesn't. Calculated as P(A∩B) - P(A∩B∩C), removing the triple intersection from the A-B pairwise intersection.
Region 3 - P(A∩C∩B'): Events A and C occur but B doesn't. Equals P(A∩C) - P(A∩B∩C).
Region 4 - P(B∩C∩A'): Events B and C occur but A doesn't. Equals P(B∩C) - P(A∩B∩C).
Region 5 - P(A∩B'∩C'): Only A occurs, neither B nor C. Calculated as P(A) - P(A∩B) - P(A∩C) + P(A∩B∩C). The addition of P(A∩B∩C) corrects for double subtraction.
Region 6 - P(B∩A'∩C'): Only B occurs. Equals P(B) - P(A∩B) - P(B∩C) + P(A∩B∩C).
Region 7 - P(C∩A'∩B'): Only C occurs. Equals P(C) - P(A∩C) - P(B∩C) + P(A∩B∩C).
Region 8 - P(A'∩B'∩C'): None of the events occur. Equals 1 - P(A∪B∪C), the complement of the union. This region lies outside all three circles.
Each result row displays a Venn diagram highlighting the corresponding region, making the geometric relationships clear. All eight probabilities sum to exactly 1, confirming complete sample space partition. With the example values in Mutually Independent mode the eight rows read 0.0600, 0.1400, 0.0900, 0.0600, 0.2100, 0.1400, 0.0900 and 0.2100, which add up to 1; in Mutually Exclusive mode with 0.2, 0.3 and 0.4 the seven overlap regions are 0 and the outside region is 0.1000. The formulas behind the regions are explained in The Inclusion-Exclusion Principle for Three Events.
Reading Three-Circle Venn Diagrams
DemoSketches for three inputs
Step 0 of 3
The calculator generates three-circle Venn diagrams for every probability, using three overlapping circles representing events A, B, and C. Circle positioning creates eight distinct regions, each corresponding to one of the fundamental event combinations.
Circle A (left-top) represents event A. Circle B (right-top) represents event B. Circle C (bottom-center) represents event C. The three circles overlap creating a characteristic three-way Venn diagram with a central triangular region where all three intersect.
Central triangle (all three circles overlap): P(A∩B∩C) - all three events occur. This is the most constrained region, requiring satisfaction of all three events simultaneously.
Three lens-shaped regions (two circles overlap): P(A∩B∩C') where A and B overlap but not C, P(A∩C∩B') where A and C overlap but not B, P(B∩C∩A') where B and C overlap but not A. These regions show pairwise occurrence without the third event.
Three crescent regions (single circle only): P(A∩B'∩C') inside circle A only, P(B∩A'∩C') inside circle B only, P(C∩A'∩B') inside circle C only. These represent exactly one event occurring.
Exterior region (outside all circles): P(A'∩B'∩C') - none of the events occur. This rectangular background region completes the sample space.
Visual encoding: The target region shades in blue (opacity 0.7). Conditioning regions (for conditional probabilities) shade light blue (opacity 0.5) showing the restricted sample space. Circle outlines use consistent stroke weights—solid lines (1.5px) for reference circles, thicker lines (2px) for conditioning events. Opacity variations (0.3 for faded, 0.7 for active) guide visual attention to relevant regions. With the example values the central triangle holds 0.0600; in Given P(A∩B∩C) mode with 0.1 it holds 0.1000 and the three lenses shrink to 0.1000, 0.0500 and 0.0200. The regions are listed in Working with the Eight Venn Diagram Regions.
Step-by-Step Calculations and Formulas
DemoOpening two step lists
Step 0 of 3
Click any result row to expand step-by-step calculations showing derivation formulas. Each calculation follows the pattern: (1) Formula stating the probability rule, (2) Substitution inserting actual values, (3) Result computing the final probability.
Example - Region "A only": Step 1 shows "P(A ∩ B' ∩ C') = P(A) - P(A∩B) - P(A∩C) + P(A∩B∩C)", the inclusion-exclusion formula for this region. Step 2 substitutes all values. Step 3 computes the result. This formula subtracts both pairwise intersections from P(A), but adds back P(A∩B∩C) because it was subtracted twice.
Example - Union via inclusion-exclusion: Step 1 shows the full inclusion-exclusion formula with seven terms. Step 2 substitutes all probabilities. Step 3 performs the arithmetic: addition of individuals, subtraction of pairs, addition of triple. The step-by-step format makes this complex calculation transparent.
Example - Conditional P(A|B∩C): Step 1 shows "P(A|B∩C) = P(A∩B∩C) / P(B∩C)", the conditional probability definition. Step 2 shows division with actual values. Step 3 computes the quotient.
The calculations reference previously computed values, showing dependency chains. P(A|B∩C) references P(A∩B∩C) and P(B∩C), both calculated earlier. This demonstrates how complex probabilities build from simpler ones through probability rules. Clicking a row a second time folds the steps away. The formulas the steps apply are explained in The Inclusion-Exclusion Principle for Three Events.
Additional Probabilities: Pairwise Unions and Intersections
DemoPairwise and conditional values in three modes
Step 0 of 3
Beyond the eight fundamental regions, the calculator computes pairwise unions and intersections useful for analyzing relationships between event pairs within the three-event system.
Pairwise unions: P(A∪B), P(A∪C), P(B∪C) give probabilities that at least one event in a pair occurs, ignoring the third. Formula: P(A∪B) = P(A) + P(B) - P(A∩B). These are computed using the two-event addition rule even within the three-event context.
Pairwise intersections: P(A∩B), P(A∩C), P(B∩C) give probabilities that both events in a pair occur, regardless of the third event. In independent mode, these equal P(A)×P(B), P(A)×P(C), P(B)×P(C). In other modes, they're provided as inputs or derived from other inputs.
Pairwise conditionals: P(A|B), P(A|C), P(B|C) give conditional probabilities for pairs. These use simple two-event conditioning: P(A|B) = P(A∩B)/P(B). They differ from triple conditionals like P(A|B∩C) which condition on two events.
Complements: P(A'), P(B'), P(C') give probabilities each event doesn't occur. Formula: P(A') = 1 - P(A). Complements ignore whether other events occurred.
The Additional Probabilities section displays all these derived probabilities with their Venn diagrams. Pairwise union diagrams shade two circles completely. Pairwise intersection diagrams shade only the lens where two circles overlap. These visualizations help understand how events relate in pairs within the three-event framework.
These probabilities are useful because real scenarios often involve questions about subsets of the three events: "What if we only care about A and B?", "What's the coverage if either A or C happens?" The calculator provides these marginal views automatically. With the example values the section reads P(A∪B)=0.7000, P(A∣B∩C)=0.5000 and P(A′)=0.5000; in Given P(A∩B∩C) mode with 0.1 the conditional rises to 0.8333, and in Given P(A∪B∪C) mode with the example union 0.82 it is 0.7500. The conditionals are explained in Conditional Probabilities with Three Events.
Interpreting Event Properties for Three Events
DemoThe three verdicts in three modes
Step 0 of 3
The Event Properties panel shows three key relationships: mutual independence, pairwise independence, and mutual exclusivity.
Mutually Independent shows "Yes" when P(A∩B∩C) = P(A)×P(B)×P(C) AND all three pairwise intersections multiply: P(A∩B) = P(A)×P(B), P(A∩C) = P(A)×P(C), P(B∩C) = P(B)×P(C). This is the strongest independence property—all four intersection probabilities factor into products. Events are completely unrelated; knowing any subset doesn't inform the others.
Pairwise Independent shows "Yes" when all three pairs are independent: P(A∩B) = P(A)×P(B), P(A∩C) = P(A)×P(C), P(B∩C) = P(B)×P(C), even if P(A∩B∩C) ≠ P(A)×P(B)×P(C). The pairs are independent but the triple isn't. This weaker property occurs in certain probability puzzles where pairs behave independently but the three together don't factor.
Mutually Exclusive shows "Yes" when P(A∩B∩C) = 0 (within 0.0001 tolerance). The three events cannot occur simultaneously. Note: this doesn't require pairwise mutual exclusivity. Events can overlap in pairs but not all three together.
Relationships: If mutually independent is "Yes", then pairwise independent is automatically "Yes" (mutual independence implies pairwise independence). If mutually exclusive is "Yes" and all events have positive probability, then neither independence property holds—mutual exclusivity contradicts independence for nonzero probabilities.
The properties section helps verify mode assumptions. Independent mode produces mutual independence "Yes" by construction. Mutually exclusive mode produces mutual exclusivity "Yes". Other modes check these properties against computed probabilities—you might discover events are actually independent even though you didn't use independent mode.
For comprehensive theory on three-event probability including proofs, examples, and extensions to n events, see three events probability theory. With the example values the panel reads Mutually Independent Yes, Pairwise Independent Yes, Mutually Exclusive No; in Given P(A∩B∩C) mode with 0.1 the first line turns to No while the pairs stay independent; in Mutually Exclusive mode the last line reads Yes. The two kinds of independence are compared in Mutual Independence vs Pairwise Independence.
Three Mutually Independent Events
Three events are mutually independent when every intersection factors: P(A∩B)=P(A)P(B), P(A∩C)=P(A)P(C), P(B∩C)=P(B)P(C) and P(A∩B∩C)=P(A)P(B)P(C). The Mutually Independent mode takes only P(A), P(B) and P(C) and builds every other probability from these products: with 0.5, 0.4 and 0.3 the pairs are 0.2, 0.15 and 0.12, the triple is 0.06, and the union is 0.5+0.4+0.3−0.2−0.15−0.12+0.06=0.79.
The eight regions then follow by subtraction: A and B without C is 0.2−0.06=0.14, A alone is 0.5−0.2−0.15+0.06=0.21, none is 1−0.79=0.21. The common mistake is to check the pairs only; three events can be pairwise independent without the triple product holding, as explained in Mutual Independence vs Pairwise Independence. See Independence and The formula.
Three Mutually Exclusive Events
Three events are mutually exclusive when no two of them can happen together, so every intersection has probability 0 and the union is the plain sum, P(A∪B∪C)=P(A)+P(B)+P(C). The Mutually Exclusive mode takes only the three probabilities: with 0.2, 0.3 and 0.4 the union is 0.9, the seven overlap regions are 0, and the outside region is 0.1.
The three probabilities must sum to at most 1; with the example values 0.5, 0.4 and 0.3 the sum is 1.2 and the calculator refuses the union as an axiom violation. The common mistake is to call events mutually exclusive when only the triple intersection is empty; the mode requires every pair to be disjoint. See Relations between events and The addition rule.
Starting from the Triple Intersection
When the probability of all three events together is known along with the three pairwise intersections, the eight regions follow by subtraction and the union by inclusion-exclusion. The Given P(A∩B∩C) mode takes P(A), P(B), P(C), P(A∩B∩C) and the three pairs: with the example values and P(A∩B∩C)=0.1 the union is 1.2−0.47+0.1=0.83, the lens A∩B without C is 0.2−0.1=0.1, A alone is 0.5−0.35+0.1=0.25, and P(A∣B∩C)=0.1/0.12≈0.8333.
The triple intersection cannot exceed any pairwise intersection, and each pair cannot exceed either of its events; the calculator refuses values that break these bounds. The common mistake is to enter the triple intersection larger than a pair, which would make a lens region negative. See The axioms of probability and Set operations on events.
Starting from the Union
When the probability of at least one event is known instead of the triple intersection, inclusion-exclusion is solved for the missing term: P(A∩B∩C)=P(A∪B∪C)−P(A)−P(B)−P(C)+P(A∩B)+P(A∩C)+P(B∩C). The Given P(A∪B∪C) mode takes P(A), P(B), P(C), the union and the three pairs: with the example values and a union of 0.82 the triple intersection is 0.82−1.2+0.47=0.09, and P(A∣B∩C)=0.09/0.12=0.75.
The union must be at least the largest single event and at most 1, and the derived triple intersection must be non-negative and no larger than any pair. The common mistake is to read the union as "exactly one event". See The addition rule and The axioms of probability.
Starting from the Pairwise Intersections
The Given Pairwise Intersections mode takes P(A), P(B), P(C), the three pairwise intersections and the triple intersection, the full set of seven numbers that fixes a three-event space, and computes the union by inclusion-exclusion together with every region, conditional probability and complement. With the example values the result is the same as in the independent case, union 0.79, because the example pairs and triple happen to be the products of the three probabilities.
Use this mode when the overlaps were measured directly, for example from a survey that counted members of each pair of groups; the Event Properties panel then tells you whether the counts are consistent with independence. The common mistake is to enter pairs that exceed one of their events. See The multiplication rule and Set operations on events.
The Inclusion-Exclusion Principle for Three Events
The inclusion-exclusion principle computes the union P(A∪B∪C) by adding individual probabilities, subtracting pairwise intersections to correct for double-counting, then adding back the triple intersection to correct for triple-subtraction. The formula: P(A∪B∪C) = P(A) + P(B) + P(C) - P(A∩B) - P(A∩C) - P(B∩C) + P(A∩B∩C).
Step 1 - Add individuals: P(A) + P(B) + P(C) counts all outcomes in at least one event. However, outcomes in two events get counted twice, and outcomes in all three get counted three times.
Step 2 - Subtract pairwise intersections: - P(A∩B) - P(A∩C) - P(B∩C) removes double-counting. But now outcomes in all three events have been removed too many times—they were added three times initially, then subtracted three times, leaving net zero.
Step 3 - Add triple intersection: + P(A∩B∩C) restores the central region that was over-corrected. Now each outcome in the union is counted exactly once.
The calculator displays this calculation in step-by-step format. For P(A)=0.5, P(B)=0.4, P(C)=0.3, P(A∩B)=0.2, P(A∩C)=0.15, P(B∩C)=0.12, P(A∩B∩C)=0.06: Union = 0.5 + 0.4 + 0.3 - 0.2 - 0.15 - 0.12 + 0.06 = 0.79.
The principle extends to any number of events with alternating signs: add singles, subtract pairs, add triples, subtract quadruples, etc. For three events, it stops at the triple intersection.
Pairwise independence means each pair of events is independent: P(A∩B) = P(A)×P(B), P(A∩C) = P(A)×P(C), and P(B∩C) = P(B)×P(C). Each event pair multiplies, but this doesn't guarantee the triple intersection multiplies.
Mutual independence (full independence) requires pairwise independence plus P(A∩B∩C) = P(A)×P(B)×P(C). All three events together must factor. Mutual independence is stronger—it implies pairwise independence but not vice versa.
Key distinction: Pairwise independence doesn't guarantee mutual independence. Three events can be pairwise independent yet dependent when considered together. Example: flip two fair coins. Let A="first coin heads", B="second coin heads", C="coins show same face". P(A)=P(B)=P(C)=0.5. Check pairs: P(A∩B)=0.25=0.5×0.5 ✓, P(A∩C)=0.25=0.5×0.5 ✓, P(B∩C)=0.25=0.5×0.5 ✓. Pairwise independent. But P(A∩B∩C)=0.25≠0.125=0.5×0.5×0.5 ✗. Not mutually independent.
The calculator's Event Properties section checks both conditions. "Pairwise Independent" shows Yes when all three pairs multiply within tolerance. "Mutually Independent" shows Yes only when pairwise independence holds AND the triple intersection multiplies. If mutually independent shows Yes, pairwise independent automatically shows Yes. The reverse isn't guaranteed.
Mutually independent mode produces both properties showing Yes by construction. Other modes check these conditions against computed probabilities.
The calculator computes conditional probabilities given intersections: P(A|B∩C), P(B|A∩C), and P(C|A∩B). These restrict the sample space to outcomes where two events already occurred, then find the third event's proportion within that restricted space.
P(A|B∩C) asks: given both B and C occurred, what's the probability A also occurred? Formula: P(A|B∩C) = P(A∩B∩C) / P(B∩C). The numerator is the triple intersection (all three events). The denominator is the conditioning intersection (B and C). For P(A∩B∩C)=0.06 and P(B∩C)=0.12, get P(A|B∩C) = 0.06/0.12 = 0.5.
The Venn diagram for P(A|B∩C) highlights circle B and C with light blue (the conditioning set), then darker blue shows the central triangle where A also occurs (numerator). The visual ratio of dark to total light area represents the conditional probability.
P(B|A∩C) similarly conditions on A and C occurring: P(B|A∩C) = P(A∩B∩C) / P(A∩C). The denominator is the A-C intersection, numerator is the triple intersection.
P(C|A∩B) conditions on A and B occurring: P(C|A∩B) = P(A∩B∩C) / P(A∩B). Denominator is the A-B intersection.
Important: These conditionals differ from simple two-event conditionals. P(A|B) uses just one conditioning event, while P(A|B∩C) uses two. The conditioning set is more restrictive—both B and C must occur—so the conditional probability can differ substantially from P(A|B) or P(A|C) individually.
The calculator also computes simple pairwise conditionals: P(A|B), P(A|C), P(B|C), using formulas like P(A|B) = P(A∩B)/P(B). These appear in the Additional Probabilities section alongside unions and intersections.
The calculator enforces probability axioms specific to three-event configurations. Violations produce detailed error messages identifying which constraint failed.
Non-negativity for all regions: All eight Venn diagram regions must have non-negative probability. Each region calculation could theoretically produce negative values if inputs are inconsistent. The validator checks: P(A∩B∩C) ≥ 0, P(A only) ≥ 0, P(B only) ≥ 0, P(C only) ≥ 0, P(A∩B∩C') ≥ 0, P(A∩C∩B') ≥ 0, P(B∩C∩A') ≥ 0, P(none) ≥ 0. Negative probabilities are impossible—they'd represent negative likelihood.
Triple intersection constraints: P(A∩B∩C) cannot exceed any pairwise intersection: P(A∩B∩C) ≤ P(A∩B), P(A∩B∩C) ≤ P(A∩C), P(A∩B∩C) ≤ P(B∩C). All three events together is a subset of any two events together. Violation means the claimed triple intersection is too large.
Pairwise intersection constraints: Each pairwise intersection cannot exceed its component events: P(A∩B) ≤ min(P(A), P(B)), P(A∩C) ≤ min(P(A), P(C)), P(B∩C) ≤ min(P(B), P(C)). Two events together cannot exceed either event individually.
Union bounds: P(A∪B∪C) must satisfy max(P(A), P(B), P(C)) ≤ P(A∪B∪C) ≤ 1. The union covers at least the largest individual event and cannot exceed certainty.
Inclusion-exclusion consistency: P(A∪B∪C) = P(A) + P(B) + P(C) - P(A∩B) - P(A∩C) - P(B∩C) + P(A∩B∩C) must hold exactly (within 0.0001 tolerance). This fundamental relationship connects all seven input probabilities. Violation means the inputs don't describe a valid probability configuration together.
When axioms are violated, all violations appear in a red error box. No results display until inputs satisfy all axioms—this prevents working with impossible probability spaces.