What is a sample space?
A sample space is the set of all possible outcomes of a probability experiment, denoted by .
Study 1 Probability Foundations and Sample Spaces with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a sample space?
A sample space is the set of all possible outcomes of a probability experiment, denoted by S.
What is an outcome?
An outcome is the result produced by one trial of a probability experiment.
What is an event in probability?
An event is a subset of the sample space representing outcomes of interest.
What does the complement Ac represent?
The complement Ac contains every outcome in S that is not in A.
What does A∪B mean?
The union A∪B contains outcomes in A, in B, or in both; it represents “A or B.”
What does A∩B mean?
The intersection A∩B contains outcomes common to both events; it represents “A and B.”
What range must every probability satisfy?
For any event A, probability satisfies 0≤P(A)≤1.
How is probability found for equally likely outcomes?
If all outcomes are equally likely, P(A)=∣S∣∣A∣: favorable outcomes divided by total outcomes.
What is the complement rule?
The complement rule is P(Ac)=1−P(A).
What is the general addition rule?
The addition rule is P(A∪B)=P(A)+P(B)−P(A∩B).
What is conditional probability?
When P(A)>0, conditional probability is P(B∣A)=P(A)P(A∩B).
What is the multiplication rule?
The multiplication rule is P(A∩B)=P(A)P(B∣A).
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
Builds core understanding of random variables, probability distributions, expected value, variability, and transformations.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.