MathematicsCombinatoricsA-Level
AQASATIBCambridgeWJECAbiturAPBaccalauréat Général

Binomial Coefficient

Calculate combinations (nCr).

Understand the formulaSee the free derivationOpen the full walkthrough

This public page keeps the free explanation visible and leaves premium worked solving, advanced walkthroughs, and saved study tools inside the app.

Core idea

Overview

The binomial coefficient represents the number of ways to choose a subset of r elements from a larger set of n distinct elements where the order of selection does not matter. It is a central component of the binomial theorem and Pascal's triangle, providing the coefficients for expanded algebraic expressions.

When to use: Apply this formula when you are selecting items from a group and the sequence of selection is irrelevant. It assumes that items are distinct and cannot be chosen more than once in a single set.

Why it matters: This equation is essential in probability theory for determining the likelihood of specific outcomes in a series of independent events. It also appears in fields ranging from genetics to computer science algorithms and network topology.

Symbols

Variables

tag = Total items n, tag = Items chosen r, calculate = Combinations

Total items n
Items chosen r
Combinations

Walkthrough

Derivation

Understanding the Binomial Coefficient (nCr)

The binomial coefficient counts the number of ways to choose r items from n without order, and appears in Pascal’s triangle and binomial expansions.

  • n and r are integers with 0 r n.
1

State the Formula:

Factorials count arrangements; dividing removes over-counting to give combinations.

2

Use the Symmetry Property:

Choosing r to include is equivalent to choosing n−r to exclude.

Result

Source: Standard curriculum — A-Level Mathematics (Probability and Series)

Free formulas

Rearrangements

Solve for

Make ^nCr the subject

Start with the definition of the binomial coefficient ``. Since `^` is an alternative notation for ``, substitute this notation to express `^` using the factorial formula.

Difficulty: 2/5

The static page shows the finished rearrangements. The app keeps the full worked algebra walkthrough.

Visual intuition

Graph

Graph unavailable for this formula.

For a fixed value of n, the binomial coefficient nCr plotted against r forms a symmetric, bell-shaped discrete distribution that resembles a polynomial curve of degree n. The graph exhibits a clear turning point at the maximum value, which occurs at the middle of the range (r = n/2), reflecting the symmetry property where nCr equals nC(n-r). As n increases, the values grow rapidly, illustrating how the number of ways to choose combinations peaks when selecting approximately half of the available items.

Graph type: polynomial

Why it behaves this way

Intuition

The binomial coefficient represents counting the distinct ways to form a subset of 'r' elements from a larger set of 'n' elements, visually akin to selecting 'r' balls from a bag of 'n' uniquely colored balls without

n
The total number of distinct items available in the set.
A larger 'n' means more items to choose from, generally increasing the number of possible combinations.
r
The number of items to be chosen from the set.
Choosing 'r' items from 'n' will result in the maximum number of combinations when 'r' is close to n/2, and fewer combinations when 'r' is close to 0 or 'n'.
n!
n factorial, representing the total number of ways to arrange all 'n' distinct items.
This term in the numerator represents all possible ordered arrangements of the 'n' items before accounting for the fact that order doesn't matter for combinations.
r!
r factorial, representing the number of ways to arrange the 'r' chosen items.
This term in the denominator corrects for the overcounting that occurs because the order of the 'r' selected items does not matter in a combination. Dividing by 'r!' removes these permutations.
(n-r)!
(n-r) factorial, representing the number of ways to arrange the 'n-r' items that were not chosen.
This term in the denominator also corrects for overcounting, as the order of the 'n-r' unselected items does not matter for the definition of the combination.
The binomial coefficient, which is the total number of unique combinations of 'r' items chosen from a set of 'n' distinct items, where the order of selection does not matter.
This value directly answers the question 'how many different groups of 'r' items can be formed from 'n' available items?'

Signs and relationships

  • r!(n-r)! (in the denominator): The product 'r!(n-r)!' appears in the denominator to remove the effects of ordering. The numerator 'n!' counts all possible permutations of 'n' items.

Free study cues

Insight

Canonical usage

The binomial coefficient calculates a number of combinations, which is an inherently dimensionless quantity representing a count of possible arrangements.

Common confusion

A common mistake is attempting to assign physical units to 'n', 'r', or the calculated number of combinations, even though these quantities represent discrete counts and are fundamentally dimensionless.

Dimension note

The binomial coefficient is a dimensionless quantity because it represents a count of possible combinations or ways to select items. The input variables 'n' and 'r' are also dimensionless integers, representing counts of

Unit systems

dimensionless · Represents the total number of distinct items available for selection. Must be a non-negative integer.
dimensionless · Represents the number of items to be chosen from the total set 'n'. Must be a non-negative integer such that 0 <= r <= n.

One free problem

Practice Problem

A committee of 3 members needs to be formed from a group of 10 employees. How many different unique committees can be created?

Total items n10
Items chosen r3

Solve for:

Hint: Apply the formula 10! / (3! × (10 - 3)!) and simplify the factorials.

The full worked solution stays in the interactive walkthrough.

Where it shows up

Real-World Context

Lottery odds.

Study smarter

Tips

  • The result is always a whole number.
  • The symmetry property means nCr is equal to nC(n-r).
  • Simplify the fraction by canceling common factorials before calculating.

Avoid these traps

Common Mistakes

  • Confusing with Permutation (nPr).
  • Calculation factorial overflow.

Common questions

Frequently Asked Questions

The binomial coefficient counts the number of ways to choose r items from n without order, and appears in Pascal’s triangle and binomial expansions.

Apply this formula when you are selecting items from a group and the sequence of selection is irrelevant. It assumes that items are distinct and cannot be chosen more than once in a single set.

This equation is essential in probability theory for determining the likelihood of specific outcomes in a series of independent events. It also appears in fields ranging from genetics to computer science algorithms and network topology.

Confusing with Permutation (nPr). Calculation factorial overflow.

Lottery odds.

The result is always a whole number. The symmetry property means nCr is equal to nC(n-r). Simplify the fraction by canceling common factorials before calculating.

References

Sources

  1. Wikipedia: Binomial coefficient
  2. Discrete Mathematics and Its Applications by Kenneth H. Rosen
  3. Wikipedia: Dimensionless quantity
  4. IUPAC Gold Book: Dimensionless quantity
  5. Discrete Mathematics and Its Applications by Kenneth H. Rosen, 7th Edition (2012)
  6. Rosen, Kenneth H. Discrete Mathematics and Its Applications. 8th ed., McGraw-Hill Education, 2019.
  7. Wikipedia article 'Binomial coefficient'
  8. Britannica article 'Combinations and permutations'