LearnViz Math
Advanced ⛓ Discrete Math & Number Theory Topic 36 of 103

Binomial Coefficients

Counts of k-subsets; entries of Pascal’s triangle.

Key idea

Counts of k-subsets; entries of Pascal’s triangle.

In depth

C(n, k) counts k-element subsets of an n-set. It satisfies C(n, k) = C(n, n − k) and Pascal’s rule C(n, k) = C(n − 1, k − 1) + C(n − 1, k). The row sum is 2ⁿ.

Worked example

C(5, 2) = 10 = C(4, 1) + C(4, 2) = 4 + 6.

Formula

C(n,k) = C(n−1,k−1)+C(n−1,k)

Real-world uses

Common mistake

Mixing up n and k.

How to learn this

  1. Read the key idea and say it in your own words.
  2. Work through the worked example, then try a similar problem.
  3. Use the interactive lesson’s visual and mini-quiz to check the pattern.

Frequently asked questions

What is Binomial Coefficients?

Counts of k-subsets; entries of Pascal’s triangle. It is a topic at the advanced level in Discrete Math & Number Theory.

What is the formula for Binomial Coefficients?

The key formula is C(n,k) = C(n−1,k−1)+C(n−1,k).

Where is Binomial Coefficients used in real life?

Real-world examples: Counting ways to choose a committee; The chances of exact numbers of heads in coin tests.

What should I learn before Binomial Coefficients?

Make sure you are comfortable with Combinations with Repetition, the previous topic in Discrete Math & Number Theory.

What is a common mistake with Binomial Coefficients?

Mixing up n and k.

How can I practise Binomial Coefficients?

Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.

What comes after Binomial Coefficients?

Move on to Binomial Theorem (Discrete) next.

Related advanced topics in Discrete Math & Number Theory