✦ScienexySCIENCE KNOWLEDGE LIBRARY
General science · SCI-FORM-MTH-010

General Binomial Coefficient

The general binomial coefficient counts the number of ways to select k distinct objects from a set of n distinct objects when order does not matter.

\(C(n, k) = n! / [k!(n - k)!]\)

What this formula means

Definition

The general binomial coefficient counts the number of ways to select k distinct objects from a set of n distinct objects when order does not matter.

Interpretation

It divides the number of ordered selections by the k! possible arrangements of each chosen group.

Mathematical Significance

Combinatorics and the multiplication principle

Scientific principle

Principle

Combinatorics and the multiplication principle

Derivation

StepExplanationExpression

1

Count ordered selections of k objects from n.

n(n−1)(n−2)…(n−k+1) = n!/(n−k)!

2

Each group of k selected objects is counted k! times because its internal order can vary.

Divide by k!

3

Obtain the number of unordered selections.

C(n,k) = n!/[k!(n−k)!]

Result

Therefore, general binomial coefficient is expressed by C(n, k) = n! / [k!(n - k)!].

Variables and their meanings

SymbolMeaningDescription

n

Total number of objects

A non-negative integer giving the size of the full set.

k

Number selected

An integer satisfying 0 ≤ k ≤ n.

!

Factorial

For a positive integer m, m! is the product 1×2×…×m, with 0! = 1.

C(n,k)

Binomial coefficient

The number of k-element subsets of an n-element set.

SI units and conversions

Si Unit

Dimensionless (1)

Dimensional Formula

[1]

Unit Explanation

This is a pure algebraic identity involving quantities of the same algebraic type; when variables represent physical quantities, each term must have consistent dimensions.

Unit Conversions

No items supplied.

Conditions of use

  • n and k must be integers with 0 ≤ k ≤ n.

  • The selected objects are distinct and order is irrelevant.

  • The factorial convention 0! = 1 is used.

Limitations and assumptions

  • If order matters, permutations rather than combinations are required.

  • The formula as written is for ordinary non-negative integer n and k; extensions require generalized definitions.

Step-by-step worked examples

ProblemGivenSolutionAnswer

How many ways can 3 students be selected from 5?

  • n = 5

  • k = 3

StepExplanationCalculation

1

Use the combination formula.

C(5,3)=5!/[3!2!]

2

Expand and cancel.

= (5×4×3×2×1)/[(3×2×1)(2×1)]

3

Evaluate.

=10

There are 10 possible groups.

Find C(8,2).

  • n = 8

  • k = 2

StepExplanationCalculation

1

Substitute.

C(8,2)=8!/[2!6!]

2

Cancel the common 6! factor.

= (8×7)/(2×1)

3

Evaluate.

=28

C(8,2) = 28.

Real-world applications

ApplicationExplanation

Probability

Counts equally likely selections in classical probability problems.

Binomial theorem

Supplies the coefficients in expansions of (a+b)^n.

Sampling and statistics

Counts possible samples of a fixed size from a finite population.

Formula Meaning

Definition

The general binomial coefficient counts the number of ways to select k distinct objects from a set of n distinct objects when order does not matter.

Interpretation

It divides the number of ordered selections by the k! possible arrangements of each chosen group.

Mathematical Significance

Combinatorics and the multiplication principle

Sources and further reading

No source has been supplied for this item yet. Treat the claim as needing editorial verification.

← Back to Formula Hub · Suggest a correction or source