Combinatorics

The binomial theorem provides an algebraic formula for expanding powers of a binomial expression. Learners will understand how to calculate coefficients using combinatorics and apply the theorem to probability and series expansions.

Combinations are selections of items from a larger set where the order of selection does not matter. Learners will understand how to calculate and apply binomial coefficients to solve counting problems in probability and statistics.

Combinatorial design theory studies how to arrange finite sets into patterns that satisfy specific symmetry and balance conditions. Learners will understand how to construct and analyze designs used in cryptography, coding theory, and experimental design.

Counting principles are the fundamental rules, such as the sum and product rules, used to enumerate configurations. Learners will understand how to systematically analyze complex combinatorial problems and determine the size of finite sets.

Generating functions encode numerical sequences as coefficients of formal power series. Learners will understand how to use algebraic operations on these series to solve recurrence relations and analyze complex combinatorial structures.

Graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. Learners will understand how to analyze network connectivity, find shortest paths, and solve optimization problems.

The principle of inclusion-exclusion is a counting technique for finding the size of the union of multiple sets. Learners will understand how to calculate probabilities and solve enumeration problems by correcting for overlapping elements.

Permutations are the distinct arrangements of a set of items where the order of selection is significant. Learners will understand how to calculate permutations, analyze symmetric groups, and solve ordering problems in probability.

Ramsey theory studies the conditions under which order must appear within large, chaotic mathematical structures. Learners will understand how to find guaranteed monochromatic substructures in colored graphs and apply these limits to combinatorics.

Recurrence relations are equations that define sequences recursively using previous terms. Learners will understand how to solve these relations using characteristic equations and generating functions to model algorithmic complexity and population growth.