Counting and Discrete Probability
If task 1 can be done in n1 ways and task 2 in n2 ways, then doing them in sequence can be done in ways
Factorials: Arranging n distinct objects in order using the multiplication rule, but shrinking by subtracting one additional for each factor →
Permutations: Arrangement of r items chosen from n distinct items where order does matter →
Combinations: Arrangement of r items chosen from n distinct items where order does not matter →
Probability
Sample Space: Set of possible outcomes
Event: Subset of outcomes
Exclusivity and Independence are not the same
Cumulative Distribution Function (CDF): Essentially a percentile; probability that a discrete random variable equals a specific value P(X=x)
Probability Mass Function (PMF): Cumulative probability that a random variable is less than or equal to a specific value P(X<=x)
Expected Value
Probability Weighted Average
Also known as the long-run average
Running Average converges over time towards the expected value
A sequence of squares is calculated by
Variance
Expected squared distance from the mean
Variance is in squared units
Standard deviation is in the same units as the mean
If x and y are discrete random variables, what is E[x+y]? E[x]+E[y]
If x and y are independent random variables, what is var(x+y)? var(x)+var(y)
If x and y are independent random variables, what is var(x+c)? var(x)
If x and y are independent random variables, what is var(ax)? a²var(x)
If we have 10 boxes, how many ways can we put 3 items in the boxes (one per box)
The Binomial Distribution
If x is the # of successes in these trials, then where are samples of a Bernoulli random variable
Bernoulli Random Variable: A discrete random variable with only two possible outcomes.
Expected value = p
Variance = p(1-p)
Newton’s Binomial
Chebyshev’s Inequality holds for any random variable with finite mean and variance