Combination

DOWNLOAD Mathematica Notebook

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k,"

 _nC_k=(n; k)=(n!)/(k!(n-k)!),

where n! is a factorial (Uspensky 1937, p. 18). For example, there are (4; 2)=6 combinations of two elements out of the set {1,2,3,4}, namely {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, and {3,4}. These combinations are known as k-subsets.

The number of combinations (n; k) can be computed in the Wolfram Language using Binomial[n, k], and the combinations themselves can be enumerated in the Wolfram Language using Subsets[Range[n],{k}].

Muir (1960, p. 7) uses the nonstandard notations (n)_k=(n; k) and (n^_)_k=(n-k; k).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.