Math · Statistics and Probability

Probability revision notes

A concise JEE revision summary of Probability.

FormulasRevision notes
Mathrevision notes

Key Concepts & Definitions

Probability theory attempts to quantify the chances of occurrence or non-occurrence of events. The modern axiomatic approach was introduced by A. N. Kolmogorov in 1933.

Sample Space (SSS)
The universal set containing all possible outcomes of a random experiment.
Event (EEE)
Any subset EEE of a sample space SSS is called an event. The event EEE is said to have occurred if the outcome ω\omegaω of the experiment is such that ω∈E\omega \in Eω∈E.
Impossible Event
The empty set ϕ\phiϕ, which contains no sample points, is an event that cannot occur.
Sure Event
The entire sample space SSS is considered a sure event because the outcome will always belong to SSS.
Simple (Elementary) Event
An event containing exactly one sample point of the sample space. In a sample space of nnn elements, there are exactly nnn simple events. → [JEE TIP] Simple events of a sample space are always mutually exclusive.
Compound Event
An event containing more than one sample point.
Mutually Exclusive Events
Two events AAA and BBB are mutually exclusive if they cannot occur simultaneously, meaning they are disjoint sets (A∩B=ϕA \cap B = \phiA∩B=ϕ).
Exhaustive Events
A set of events E1,E2,...,EnE_1, E_2, ..., E_nE1​,E2​,...,En​ is exhaustive if their union is the entire sample space (E1∪E2∪...∪En=SE_1 \cup E_2 \cup ... \cup E_n = SE1​∪E2​∪...∪En​=S). At least one of them necessarily occurs whenever the experiment is performed.
Mutually Exclusive and Exhaustive Events
A set of events that are pairwise disjoint (Ei∩Ej=ϕE_i \cap E_j = \phiEi​∩Ej​=ϕ for i≠ji \neq ji=j) and whose union forms the sample space SSS.

Algebra of Events and Set Theory Equivalences

Analogous to set theory, events can be combined to form new events:

  • Complementary Event ('not A'): Denoted by AA', A\overline{A}, or AcA^c. It consists of all outcomes in SS that are not in AA. A={ω:ωS and ωA}=SAA' = \{\omega: \omega \in S \text{ and } \omega \notin A\} = S - A.
  • The Event 'A or B' (ABA \cup B): The event that either AA occurs, or BB occurs, or both occur.
  • The Event 'A and B' (ABA \cap B): The event that both AA and BB occur simultaneously.
  • The Event 'A but not B' (ABA - B): Elements in AA but not in BB. Represented as AB=ABA - B = A \cap B'. → [JEE TIP] The formula P(AB)=P(A)P(AB)P(A - B) = P(A) - P(A \cap B) is heavily tested in JEE for calculating exact occurrences.

Axiomatic Approach to Probability

Let SS be the sample space. The probability PP is a real-valued function whose domain is the power set of SS and range is the interval [0,1][0, 1], satisfying the following axioms:

  1. Axiom 1: For any event EE, P(E)0P(E) \ge 0.
  2. Axiom 2: P(S)=1P(S) = 1.
  3. Axiom 3: If EE and FF are mutually exclusive events, then P(EF)=P(E)+P(F)P(E \cup F) = P(E) + P(F).

From Axiom 3, substituting F=ϕF = \phi, we get P(Eϕ)=P(E)+P(ϕ)P(ϕ)=0P(E \cup \phi) = P(E) + P(\phi) \Rightarrow P(\phi) = 0. For outcomes ωiS\omega_i \in S:

  • 0P(ωi)10 \le P(\omega_i) \le 1.
  • P(ωi)=1\sum P(\omega_i) = 1.
  • For any event AA, P(A)=ωiAP(ωi)P(A) = \sum_{\omega_i \in A} P(\omega_i).

Advanced Probability Concepts (JEE Advanced Topics)

  • Conditional Probability: The probability of event AA occurring given that event BB has already occurred. P(AB)=P(AB)P(B)P(A|B) = \frac{P(A \cap B)}{P(B)} (where P(B)0P(B) \neq 0).
  • Multiplication Theorem: P(AB)=P(A)P(BA)P(A \cap B) = P(A) \cdot P(B|A).
  • Independent Events: Two events AA and BB are independent if the occurrence of one does not affect the occurrence of the other. Condition: P(AB)=P(A)P(B)P(A \cap B) = P(A) \cdot P(B). → [JEE TIP] Do not confuse independent events with mutually exclusive events. Mutually exclusive events are highly dependent (if one happens, the other strictly cannot).
  • Law of Total Probability: If E1,E2,...,EnE_1, E_2, ..., E_n form a set of mutually exclusive and exhaustive events, and AA is any event, then P(A)=i=1nP(Ei)P(AEi)P(A) = \sum_{i=1}^{n} P(E_i) \cdot P(A|E_i).
  • Bayes' Theorem: Reverses conditional probability. P(EiA)=P(Ei)P(AEi)j=1nP(Ej)P(AEj)P(E_i|A) = \frac{P(E_i) \cdot P(A|E_i)}{\sum_{j=1}^{n} P(E_j) \cdot P(A|E_j)}. → [JEE TIP] Always define your EiE_i partitions clearly before applying Bayes' Theorem to avoid denominator traps.
  • Binomial Probability Distribution: For nn independent Bernoulli trials with probability of success pp and failure q=1pq = 1-p, the probability of exactly rr successes is P(X=r)=nCrprqnrP(X=r) = {}^nC_r p^r q^{n-r}.
  • Random Variables: Mean (Expected value) μ=xipi\mu = \sum x_i p_i. Variance σ2=xi2piμ2\sigma^2 = \sum x_i^2 p_i - \mu^2.

Formulae, Equations & Units

Concept / QuantityFormulaDefinitions & Variables
Equally Likely OutcomesP(E)=n(E)n(S)P(E) = \frac{n(E)}{n(S)}n(E)n(E): Number of favourable outcomes, n(S)n(S): Total possible outcomes.
Complementary EventP(A)=1P(A)P(A') = 1 - P(A)P(A)P(A') is the probability of 'not A'.
Addition Theorem (2 sets)P(AB)=P(A)+P(B)P(AB)P(A \cup B) = P(A) + P(B) - P(A \cap B)P(AB)P(A \cup B) is the probability of AA or BB or both.
Addition Theorem (3 sets)P(ABC)=P(A)+P(B)+P(C)P(AB)P(BC)P(AC)+P(ABC)P(A \cup B \cup C) = P(A) + P(B) + P(C) - P(A \cap B) - P(B \cap C) - P(A \cap C) + P(A \cap B \cap C)Evaluates probability of at least one of three events occurring.
Mutually Exclusive Add.P(AB)=P(A)+P(B)P(A \cup B) = P(A) + P(B)Used ONLY when AB=ϕA \cap B = \phi.
Difference of EventsP(AB)=P(A)P(AB)P(A - B) = P(A) - P(A \cap B)Probability of AA occurring but not BB.
De Morgan's Laws (Prob)P(AB)=P((AB))=1P(AB)P(A' \cap B') = P((A \cup B)') = 1 - P(A \cup B)Evaluates "neither A nor B".
Conditional ProbabilityP(AB)=P(AB)P(B)P(A\|B) = \frac{P(A \cap B)}{P(B)}Given P(B)0P(B) \neq 0.
IndependenceP(AB)=P(A)P(B)P(A \cap B) = P(A)P(B)Required for multiple independent trials.

(Note: Probability is a dimensionless, unitless ratio. Always falls in the interval [0,1][0, 1].)

Conditions & Limitations

  • Equally Likely Restriction: The classical formula P(E)=n(E)/n(S)P(E) = n(E) / n(S) CANNOT be used if the sample points are not equally likely. If a coin is biased, you must use the Axiomatic rule P(A)=ωiAP(ωi)P(A) = \sum_{\omega_i \in A} P(\omega_i) by summing the individual valid, non-equal probabilities.
  • Axiomatic Validity: Any assigned probability distribution is only valid if both 0P(ωi)10 \le P(\omega_i) \le 1 and P(ωi)=1\sum P(\omega_i) = 1 hold true simultaneously.
  • Empty Sets in Conditionals: P(AB)P(A|B) is completely undefined if P(B)=0P(B) = 0.

Standard Derivations & Step-by-Step Problem Solving

Derivation of the Addition Theorem P(AB)=P(A)+P(B)P(AB)P(A \cup B) = P(A) + P(B) - P(A \cap B):

  1. Express ABA \cup B as disjoint sets: AB=A(BA)A \cup B = A \cup (B - A).
  2. Because AA and (BA)(B - A) are mutually exclusive, apply Axiom 3: P(AB)=P(A)+P(BA)P(A \cup B) = P(A) + P(B - A).
  3. Express BB as disjoint sets: B=(AB)(BA)B = (A \cap B) \cup (B - A).
  4. Apply Axiom 3 again: P(B)=P(AB)+P(BA)P(B) = P(A \cap B) + P(B - A).
  5. Subtract the second equation from the first: P(AB)P(B)=P(A)P(AB)P(A \cup B) - P(B) = P(A) - P(A \cap B).
  6. Rearrange to get the final theorem: P(AB)=P(A)+P(B)P(AB)P(A \cup B) = P(A) + P(B) - P(A \cap B).

⚠️ COMMON MISCONCEPTIONS & SIGN CONVENTIONS

  • Mutually Exclusive vs. Independent: Students frequently confuse these. Mutually exclusive means P(AB)=0P(A \cap B) = 0. Independent means P(AB)=P(A)P(B)P(A \cap B) = P(A)P(B). Non-empty mutually exclusive events are never independent.
  • "Or" vs. "And": "Or" correlates with Union (\cup) and Addition. "And" correlates with Intersection (\cap) and Multiplication.
  • Exactly One vs. At Least One:
    • Probability of exactly one of A or B = P(A)+P(B)2P(AB)P(A) + P(B) - 2P(A \cap B).
    • Probability of at least one of A or B = P(AB)=P(A)+P(B)P(AB)P(A \cup B) = P(A) + P(B) - P(A \cap B).
  • Pairwise vs. Mutually Independent: For 3 events to be independent, they must be pairwise independent (P(AB)=P(A)P(B)P(A \cap B) = P(A)P(B), etc.) AND mutually independent (P(ABC)=P(A)P(B)P(C)P(A \cap B \cap C) = P(A)P(B)P(C)). Pairwise independence does not guarantee mutual independence.
  • Order Importance in Combinatorics: When drawing items "without replacement", standard combination formulas (nCr^nC_r) ignore order. If order matters (e.g., drawing specifically a Red then Blue), use permutations (nPr^nP_r) or direct multiplication of sequential probabilities.

Previous Year JEE Topics

  • Bayes' Theorem & Total Probability: Heavily tested via urn models, diagnostic tests, and sequential factory production scenarios.
  • Binomial Distribution bounds & maximization: Finding the maximum probability in a binomial distribution or calculating expected values.
  • Geometric Probability: Solving probability of regions intersecting (using area/volume integrals instead of discrete counting).
  • Derangements: Probability that none of nn items goes into their correct corresponding envelopes.
  • Sets and Venn Diagrams: Extracting P(AB)P(A \cap B'), P(AB)P(A \cup B)', etc., given percentages of a population.

Top 10 JEE MCQ Traps

  1. Misconception: Assuming P(AB)=P(A)+P(B)P(A \cup B) = P(A) + P(B) universally. Correct Understanding: This only applies if AA and BB are strictly mutually exclusive (AB=ϕA \cap B = \phi). Always subtract P(AB)P(A \cap B) otherwise.
  2. Misconception: Treating Mutually Exclusive and Independent events as the same thing. Correct Understanding: Mutually exclusive means P(AB)=0P(A \cap B) = 0. Independent means P(AB)=P(A)P(B)P(A \cap B) = P(A)P(B).
  3. Misconception: Calculating "probability of A or B but not both" as P(AB)P(A \cup B). Correct Understanding: "Exactly one of A or B" requires subtracting the intersection twice: P(AB)P(AB)=P(A)+P(B)2P(AB)P(A \cup B) - P(A \cap B) = P(A) + P(B) - 2P(A \cap B).
  4. Misconception: Multiplying probabilities directly without checking for replacement. Correct Understanding: If drawing without replacement, the sample space shrinks. You must use conditional probability P(BA)P(B|A) or Combinatorics (nCr^nC_r).
  5. Misconception: Summing P(Ei)P(E_i) in a Bayes' theorem denominator without making sure the events EiE_i form an exhaustive and mutually exclusive partition. Correct Understanding: The Law of Total Probability only holds if P(Ei)=1\sum P(E_i) = 1 and EiEj=ϕE_i \cap E_j = \phi.
  6. Misconception: Ignoring the scaling factor when a problem states a restricted sample space (e.g., "Given that an even number rolled..."). Correct Understanding: This restricts the denominator. P(AB)=n(AB)/n(B)P(A|B) = n(A \cap B) / n(B), not n(AB)/n(S)n(A \cap B) / n(S).
  7. Misconception: Forgetting that identical objects distribute differently than distinct objects. Correct Understanding: Ensure the classical definition P=n(E)/n(S)P = n(E)/n(S) uses a sample space of equally likely outcomes. Combinatorics with identical items often creates outcomes that are not equally likely unless items are treated as artificially distinct.
  8. Misconception: Assuming P(A)=1+P(A)P(A') = 1 + P(A) or sign errors in De Morgan's equations. Correct Understanding: P(A)=1P(A)P(A') = 1 - P(A). Additionally, P(neither A nor B)=1P(AB)P(\text{neither A nor B}) = 1 - P(A \cup B), not 1P(AB)1 - P(A \cap B).
  9. Misconception: Thinking probability values can be greater than 1 when adding multiple sets. Correct Understanding: Probabilities strictly live in [0,1][0, 1]. If an addition yields >1> 1, you forgot to subtract the intersection overlaps.
  10. Misconception: Confusing P(AB)P(A|B) with P(BA)P(B|A) in conditional word problems (Base Rate Fallacy). Correct Understanding: P(AB)P(BA)P(A|B) \neq P(B|A). "Probability of having the disease given you tested positive" is distinct from "Probability of testing positive given you have the disease." Use Bayes' Theorem to convert them.
Notes fade fast. Rhovecs re-surfaces each concept on a forgetting schedule and picks what you practise next — so revision sticks.See how it works
Other chapters

Rhovecs re-surfaces each concept right before you’d forget it — and picks the next thing to practise. We decide, you execute.

Get started