1. Lesson 4

1.15. Lesson 4 Summary

Mathematics 30-2 Module 3

Module 3: Permutations, Combinations, and the Fundamental Counting Principle

 

Lesson 4 Summary

 

Combinations can be used to solve counting problems where the order is not important. A combination can be represented by nCr or where n is the size of the group from which the objects are taken and r is the number of objects that are taken at a time. The formula can be used to calculate a combination where 0 ≤ n ≤ r. Many problems will require you to calculate multiple combinations and apply the fundamental counting principle.

 

In Lesson 5 you will use permutations and combinations to model and solve problems.