What does count?
a binomial coefficient
counts the unordered -element subsets of an -element set, where .
Study 07 Advanced Counting Methods with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does (kn) count?
a binomial coefficient
(kn)
counts the unordered k-element subsets of an n-element set, where (kn)=k!(n−k)!n!.
State the symmetry identity for binomial coefficients.
Symmetry gives (kn)=(n−kn), because choosing the selected objects is equivalent to choosing the objects left out.
What is Pascal's identity?
Pascal's identity is (kn)=(k−1n−1)+(kn−1). It separates selections according to whether a distinguished object is chosen.
How many selections with repetition are possible?
The number of ways to select k objects from n types when repetition is allowed is (kn+k−1).
State the binomial theorem.
The binomial theorem states (x+y)n=∑k=0n(kn)xn−kyk for nonnegative integer n.
How do you extract a coefficient from (x+y)n?
The coefficient of xn−kyk in (x+y)n is (kn). For example, the coefficient of x5y3 in (x+y)8 is (38)=56.
What is inclusion-exclusion for two sets?
For two finite sets, ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣. The intersection is subtracted because it was counted twice.
What sign pattern does three-set inclusion-exclusion use?
For three sets, add single-set sizes, subtract pairwise intersections, then add the triple intersection: ∣A∪B∪C∣=∑∣A∣−∑∣A∩B∣+∣A∩B∩C∣.
How does inclusion-exclusion count objects avoiding all restrictions?
If Ai is the set violating restriction i, then valid objects number ∣S∣−∣⋃iAi∣, equivalently ∣⋂iAic∣.
What formula counts derangements?
The number of derangements of n objects is Dn=n!∑k=0nk!(−1)k, and approximately en!.
What makes a recurrence-based counting argument complete?
A complete recurrence description needs initial conditions, a recurrence relation, and a justification based on an exhaustive, disjoint case partition.
What recurrence counts binary strings with no consecutive 1s?
For binary strings with no consecutive 1s, an=an−1+an−2, with a0=1 and a1=2. The cases end in 0 or in 01.
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 progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A medium-difficulty quiz on double and triple integrals, including regions of integration, applications, density, average value, moments, and integral setup.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
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.
A connected guide to modeling geometry, motion, mass, fields, work, flux, and optimization with the main tools of multivariable calculus.