Linked from

The 58 pages that link to Binomial coefficient, each with the reason it gives.

• CombinatoricsRelated: These coefficients encode many fundamental selection counts and identities.

• FactorialRelated: Its factorial formula is n! divided by k!(n − k)!.

• Binomial distributionRelated: It counts which trials succeed when the total success count is fixed.

• Power setRelated: It counts the power-set members having each particular size.

• Finite differenceRelated: Binomial coefficients appear in the formula for differences of higher order.

• Fibonacci sequenceRelated: Sums along diagonals of Pascal's triangle produce Fibonacci numbers.

• Inclusion–exclusion principleRelated: It counts how many subsets of conditions contain a given element.

• MultisetRelated: Counting multisets of fixed size leads to combinations with repetition.

• Birthday ProblemRelated: It counts the pairs of people whose birthdays could match.

• Bertrand's postulateRelated: Central binomial coefficients encode prime factors that force a prime between n and 2n.

• Stirling numbers of the second kindRelated: It appears in the identity S(n,k)=Σⱼ₌₀ᵏ⁻¹ binom(n−1,j)S(n−1−j,k−1).

• Exterior algebraRelated: For an n-dimensional space, the degree-k exterior power has dimension n choose k.

• Jacob BernoulliRelated: Binomial coefficients count outcome sequences in repeated two-outcome experiments.

• CombinationRelated: It counts combinations of a given size from a set of distinct objects.

• DiagonalRelated: Choosing two vertices gives the total candidate segments before boundary edges are excluded.

• Negative binomial distributionRelated: It counts the ways failures can appear before the final required success.

• Stars and barsRelated: It gives the formula for choosing separator positions among stars and bars.

• Falling factorialRelated: Dividing a falling factorial by n! gives the binomial coefficient when n is a nonnegative integer.

• Multinomial coefficientRelated: Repeated binomial choices decompose a multinomial count into successive selections.

• Erdős–Ko–Rado theoremRelated: It gives the exact maximum number of sets in the theorem.

• Triangular numberRelated: The nth triangular number equals the number of ways to choose two objects from n + 1.

• Legendre's formulaRelated: Subtracting three factorial valuations gives each prime's exponent in a binomial coefficient.

• Newton's identitiesRelated: Equivalent identity conventions use binomial coefficients to normalize sums.

• Turán's theoremRelated: It counts possible edges and appears in exact forms of the extremal bound.

• Sperner's theoremRelated: The theorem's bound is the largest binomial coefficient among the subset-lattice ranks.

• Cauchy–Binet formulaRelated: The sum ranges over subsets of intermediate indices, whose number is a binomial coefficient.

• Erdős–Rado theoremRelated: Partition notation uses brackets to indicate which finite subsets are colored.

• Gilbert–Varshamov boundRelated: For binary strings, each Hamming sphere’s size is a binomial coefficient.

• Abel's binomial theoremRelated: These coefficients weight the terms in Abel’s sum.

• Bertrand's ballot theoremRelated: It counts all possible placements of the p votes among the p+q positions.

• Bohr–Mollerup theoremRelated: The gamma function supplies a continuous extension of factorial-based coefficient formulas.

• Bonse's inequalityRelated: Binomial-coefficient estimates provide a standard route to bounds involving products of primes.

• Hamming boundRelated: The volume of a Hamming ball is a sum of binomial coefficients for a binary alphabet.

• NonogramRelated: It helps count how many arrangements can fit a line’s clue and remaining gaps.

• Baranyai's theoremRelated: It counts the hyperedges that the theorem distributes among its factors.

• Carlson's theoremRelated: Analytic continuations of binomial expressions can be compared using their integer values and growth.

• Combinatorial principlesRelated: It is the central count underlying many arrangement and selection formulas.

• Lah numberRelated: Choosing the k−1 gaps between lists contributes the factor \(\binom{n-1}{k-1}\).

• Partial permutationRelated: Choosing the k-element domain contributes the factor that combines with the falling factorial.

• Twelvefold wayRelated: Choosing which boxes receive one object is a basic special case of distribution.