Pascal's Triangle and Binomial Coefficients

Explore combination count, pascal recurrence, binomial coefficients.

Lesson 4 of 53 parts Practice Flashcards
1/3
1

Combination Count

Objective: Explain combination count and use it to solve or interpret a problem.

C(n,k)=n!/[k!(n−k)!] counts unordered selections from n distinct objects, with 0≤k≤n. For arrangements or assigned roles, use a permutation count.

Worked examples

Try itPascal's Triangle and Binomial Coefficients — practice 1.1: How many ways can 2 students be selected from 7 students?Show answer

Step 1: Order does not matter, so use C(7,2). Step 2: Compute (7)(6)/2. Step 3: The value is 21.

Swipe sideways to move between sections

You finished the reading!

Lock it in with a few practice questions, then move on to the next lesson.