What does the addition principle count?
For mutually exclusive alternatives, add the numbers of choices: .
Study 2 Counting Techniques with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does the addition principle count?
For mutually exclusive alternatives, add the numbers of choices: m+n.
How do you count overlapping categories?
Subtract the overlap: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣.
What does the multiplication principle count?
Multiply the numbers of choices at successive stages: n1n2⋯nk.
What is a factorial?
For a positive integer, n!=n(n−1)⋯2⋅1; by definition, 0!=1.
What is a permutation?
A permutation is an arrangement in which order matters. The count is P(n,r)=(n−r)!n!.
How are arrangements with repeated objects counted?
For repeated objects, divide by the factorial of each repetition count: n1!n2!⋯nk!n!.
What is a combination?
A combination is an unordered selection. Its count is (rn)=r!(n−r)!n!.
How do you choose between permutations and combinations?
Use a permutation when changing order creates a different outcome; use a combination when it does not.
How are permutations and combinations related?
The relationship is P(n,r)=(rn)r!: first choose the objects, then arrange them.
What is the finite equally likely probability formula?
For equally likely outcomes, P(A)=∣S∣∣A∣, where ∣A∣ is favorable outcomes and ∣S∣ is total outcomes.
How many five-card hands are possible?
The number of five-card hands is (552)=2,598,960, because deal order does not matter.
How is exactly two aces counted in a five-card hand?
Count favorable hands as (24)(348), then divide by (552).
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.