What range can a probability have?
A probability is a number from 0 to 1, where 0 means impossible and 1 means certain; it may also be expressed as a percentage.
Study 03 Probability with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What range can a probability have?
A probability is a number from 0 to 1, where 0 means impossible and 1 means certain; it may also be expressed as a percentage.
What is the difference between a sample space and an event?
The sample space is the set of all possible outcomes, while an event is a subset of that sample space.
How is an equally likely event probability calculated?
For equally likely outcomes, P(A)=number of outcomes in Snumber of outcomes in A.
What is the complement rule?
The complement Ac contains outcomes not in A, and its probability is P(Ac)=1−P(A).
What do intersection and union mean?
The intersection A∩B means both events occur; the union A∪B means at least one occurs, including the possibility that both occur.
What is the general addition rule?
The general addition rule is P(A∪B)=P(A)+P(B)−P(A∩B). The intersection is subtracted because it was counted twice.
What does the multiplication principle count?
If successive steps have m choices and n choices, the process has m×n possible outcomes; multiply across additional steps.
When should you use a permutation?
A permutation is an arrangement in which order matters. Selecting a president and vice president is a permutation because the roles differ.
What is the permutation formula?
The number of permutations of r objects selected from n distinct objects is nPr=(n−r)!n!.
When should you use a combination?
A combination is a selection in which order does not matter. A three-person committee is a combination because membership, not ordering, matters.
How is conditional probability defined?
For P(B)>0, conditional probability is P(A∣B)=P(B)P(A∩B). The condition restricts attention to outcomes in B.
What does it mean for two events to be independent?
Events are independent when one occurring does not change the probability of the other; equivalently, P(A∩B)=P(A)P(B).
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.
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 progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
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.