What is the primary difference between $P(X < 4)$ and $P(X \le 4)$ in a discrete distribution where $X$ takes integer values?

$P(X \le 4)$ includes the probability of the outcome 4, whereas $P(X < 4)$ only sums probabilities up to the outcome 3. In discrete math, the inclusion of the boundary point significantly changes the total probability.

When calculating $P(X > k)$, how can the complement rule be applied to simplify the work?

It can be calculated as $1 - P(X \le k)$. This is especially useful when $X$ has many possible values greater than $k$ but only a few values less than or equal to $k$.

How does a Discrete Uniform Distribution differ from a general Discrete Probability Distribution?

In a Uniform Distribution, every possible outcome has the exact same probability ($1/n$). In a general distribution, different outcomes can have different probabilities as long as they sum to 1.

What is a common mistake when solving for an unknown constant $k$ in a probability mass function?

Students often forget to set the sum of all probabilities to 1. They might also incorrectly include values of $x$ that are outside the defined range of the function.

Why is it incorrect to say $P(X = 2.5)$ for a discrete random variable defined on integers?

Discrete random variables only exist at specific, defined points. If 2.5 is not in the set of possible outcomes, its probability is exactly 0 by definition.

What error occurs if the sum of probabilities in a table is 1.05?

This indicates a calculation error or an invalid distribution. By the axioms of probability, the sum of all mutually exclusive outcomes in a sample space must be exactly 1.

Define the 'Probability Mass Function' (PMF).

A PMF is a function $f(x)$ that gives the probability that a discrete random variable is exactly equal to some value $x$. It is the discrete equivalent of a probability density function.

What does the notation $F(x)$ represent in the context of probability?

It represents the Cumulative Distribution Function (CDF), defined as $F(x) = P(X \le x)$. It gives the 'running total' of probability up to and including the value $x$.

State the two mathematical conditions required for a valid discrete probability distribution.

1) Every individual probability must satisfy $0 \le P(X=x) \le 1$. 2) The sum of all probabilities across the entire sample space must equal 1 ($\sum P = 1$).

What is the formula for the probability of an outcome in a Discrete Uniform Distribution with $n$ outcomes?

$P(X = x) = \frac{1}{n}$. This applies to every $x$ in the finite set of possible outcomes.

Library Podcasts

Courses

Referral & Rewards

Statistical Distributions

Discrete Probability Distributions

Summary

A discrete probability distribution is a mathematical framework that maps every possible outcome of a discrete random variable to its specific probability of occurrence. It provides a complete description of a random process where outcomes are distinct, countable values, ensuring that the total likelihood across all possible events equals exactly one.

1. Definition & Core Concepts

Discrete Random Variable (DRV): A variable whose numerical value is determined by the outcome of a random experiment and can only take specific, isolated values. These values are typically integers or counts, such as the number of successes in a set of trials.
Notation Conventions: In probability theory, an uppercase letter like $X$ represents the random variable itself (the 'rule'), while a lowercase letter like $x$ represents a specific numerical outcome. The expression $P(X = x)$ denotes the probability that the variable $X$ takes the specific value $x$ .
Probability Mass Function (PMF): This is a functional representation of a discrete distribution, where a formula is used to calculate the probability for any given input $x$ . Unlike continuous variables, discrete variables have non-zero probabilities at specific points.

A vertical line graph representing a discrete probability distribution, showing distinct probabilities for specific x-values.

2. Underlying Principles

3. Methods & Techniques

4. Key Distinctions

5. Exam Strategy & Tips