combinatorial number | generalized binomial coefficient

The binomial coefficient is a notation and function giving the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number.

The binomial coefficient (n k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols _n C_k and (n k) are used to denote a binomial coefficient, and are sometimes read as "n choose k."

Apéry number | balanced binomial coefficient | ballot problem | Bernoulli triangle | binomial | binomial distribution | binomial identity | binomial sums | binomial theorem | central binomial coefficient | choose | Christmas stocking theorem | Chu-Vandermonde identity | combination | deficiency | Erdős squarefree conjecture | exceptional binomial coefficient | factorial | fibonomial coefficient | gamma function | good binomial coefficient | kings problem | Klee's identity | k-subset | Lah number | multichoose | multinomial coefficient | Pascal's formula | permutation | q-binomial coefficient | Roman coefficient | Sárkőzy's theorem | Stanley's identity | star of David theorem | Stolarsky-Harborth constant | Strehl identities | Székely identity | Wolstenholme's theorem

Binomial

college level