Ontology Browser
›
combinatorics
› Combination C(n,k) = nCr
Combination C(n,k) = nCr
Layer 0 — Mathematics
in the
combinatorics
subtree
Number of k-subsets of an n-set: C(n,k) = n! / (k! (n-k)!). Entries of Pascal's triangle.
Related concepts
Factorial n!
Permutation P(n,k)
Binomial theorem
Inclusion-exclusion principle
Catalan numbers C_n
Ramsey's theorem
Graph G = (V, E)
Integer partition
Stirling numbers of 1st/2nd kind
Catalan numbers
Szemerédi's theorem
Erdős-Ko-Rado theorem
Ramsey's theorem (finite/infinite)
Matroid
Sperner / LYM inequality
Explore Combination C(n,k) = nCr on the interactive knowledge graph →