Probability

ЁЯПл MP BoardClass 11Mathematics

ЁЯУР Formula & Cheat Sheet (English)

Quick Revision Notes: Class 11 Mathematics

Chapter: Probability (рдкреНрд░рд╛рдпрд┐рдХрддрд╛)


### 1. Important Terms & Definitions

  • Random Experiment (рдпрд╛рджреГрдЪреНрдЫрд┐рдХ рдкреНрд░рдпреЛрдЧ): An experiment whose outcomes cannot be predicted with certainty in advance, even though all possible outcomes are known.
  • Sample Space (рдкреНрд░рддрд┐рджрд░реНрд╢ рд╕рдорд╖реНрдЯрд┐ - $S$): The set of all possible outcomes of a random experiment.
    • Example: Rolling a die: $S = {1, 2, 3, 4, 5, 6}$
  • Event (рдШрдЯрдирд╛ - $E$): A subset of the sample space ($E \subset S$).
  • Elementary Event (рдкреНрд░рд╛рд░рдВрднрд┐рдХ рдШрдЯрдирд╛): An event having only a single outcome of the sample space.
  • Compound Event (рд╕рдВрдпреБрдХреНрдд рдШрдЯрдирд╛): An event having more than one outcome.
  • Sure Event (рдирд┐рд╢реНрдЪрд┐рдд рдШрдЯрдирд╛): An event that always occurs (equal to sample space $S$).
  • Impossible Event (рдЕрд╕рдВрднрд╡ рдШрдЯрдирд╛): An event that cannot occur (equal to empty set $\phi$).

### 2. Types of Events (рдШрдЯрдирд╛рдУрдВ ┌й█Т рдкреНрд░рдХрд╛рд░)

  • Complementary Event (рдкреВрд░рдХ рдШрдЯрдирд╛ - $E'$ or $\bar{E}$): "Not $E$". The event representing all outcomes that are not in $E$.
    • $\bar{E} = S - E$
  • Mutually Exclusive Events (рдкрд░рд╕реНрдкрд░ рдЕрдкрд╡рд░реНрдЬреА рдШрдЯрдирд╛рдПрдБ): Two events $A$ and $B$ are mutually exclusive if they cannot occur simultaneously.
    • $A \cap B = \phi \implies P(A \cap B) = 0$
  • Exhaustive Events (рдирд┐рдГрд╢реЗрд╖ рдШрдЯрдирд╛рдПрдБ): A set of events $A_1, A_2, \dots, A_n$ is exhaustive if their union is the entire sample space $S$.
    • $A_1 \cup A_2 \cup \dots \cup A_n = S \implies P(A_1 \cup A_2 \cup \dots \cup A_n) = 1$

### 3. Classical Definition of Probability (рдкреНрд░рд╛рдпрд┐рдХрддрд╛ рдХреА рд╢рд╛рд╕реНрддреНрд░реАрдп рдкрд░рд┐рднрд╛рд╖рд╛)

For a finite sample space $S$ with equally likely outcomes, the probability of an event $E$ is given by:

$$P(E) = \frac{\text{Number of favourable outcomes to } E}{\text{Total number of outcomes in } S} = \frac{n(E)}{n(S)}$$

Key Rules:

  1. $0 \le P(E) \le 1$
  2. $P(S) = 1$ (Sure Event)
  3. $P(\phi) = 0$ (Impossible Event)
  4. $P(\bar{E}) = 1 - P(E)$ or $P(E) + P(\bar{E}) = 1$

### 4. Addition Theorems of Probability (рдпреЛрдЧ рдкреНрд░рдореЗрдп)

  • General Addition Rule (рд╕рд╛рдорд╛рдиреНрдп рдпреЛрдЧ рдирд┐рдпрдо): For any two events $A$ and $B$: $$P(A \cup B) = P(A) + P(B) - P(A \cap B)$$

  • For Mutually Exclusive Events ($A \cap B = \phi$): $$P(A \cup B) = P(A) + P(B)$$

  • For Three Events ($A, B, C$): $$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)$$


### 5. Useful Relations (рдорд╣рддреНрд╡рдкреВрд░реНрдг рд╕рдВрдмрдВрдз)

  • $P(A \text{ or } B) = P(A \cup B)$
  • $P(A \text{ and } B) = P(A \cap B)$
  • Difference Event ($A - B$ or $A \text{ but not } B$): $$P(A - B) = P(A) - P(A \cap B)$$
  • De Morgan's Laws:
    • $\overline{A \cup B} = \bar{A} \cap \bar{B} \implies P(\overline{A \cup B}) = 1 - P(A \cup B)$
    • $\overline{A \cap B} = \bar{A} \cup \bar{B} \implies P(\overline{A \cap B}) = 1 - P(A \cap B)$
  • Probability of occurrence of exactly one of the events $A$ or $B$: $$P(A \text{ only}) + P(B \text{ only}) = P(A) + P(B) - 2P(A \cap B)$$

### 6. Important Tips for Problem Solving (рдкрд░реАрдХреНрд╖рд╛ рдЙрдкрдпреЛрдЧреА рдЯрд┐рдкреНрд╕)

  1. At least one (рдХрдо рд╕реЗ рдХрдо рдПрдХ): $P(\text{At least one } A) = 1 - P(\text{None of them})$.
  2. Cards Problems (рддрд╛рд╢ рдХреЗ рдкрддреНрддреЛрдВ рдкрд░ рдЖрдзрд╛рд░рд┐рдд):
    • Total cards = 52
    • Red cards = 26 (Hearts тЩе 13, Diamonds тЩж 13)
    • Black cards = 26 (Spades тЩа 13, Clubs тЩг 13)
    • Face cards (рддрд╕реНрд╡реАрд░ рд╡рд╛рд▓реЗ рдкрддреНрддреЗ) = 12 (4 Kings, 4 Queens, 4 Jacks)
  3. Coins Problems (рд╕рд┐рдХреНрдХреЗ):
    • For $n$ coins tossed, $n(S) = 2^n$.
  4. Dice Problems (рдкрд╛рд╕реЗ):
    • For $n$ dice rolled, $n(S) = 6^n$.