Math 1108-R08 Lecture 14 - Permutations, Combinations, and Counting Examples

In today's lecture, we revisit the permutation--a way to count the number of r-tuples that can be formed from a set of n elements, and we introduce the combination--a way to count the number of r-sets that can be formed from a set of n elements. These numbers help us to figure out how to choose r elements from n elements in a certain order (the permutation) or in no particular order (the combination).

We then apply these and the other counting principles previously learned, including the infamous multiplication rule, to solve counting problems.

math,jhevon,jhevon smith,smith,mathematics,math 1108,finite math,finite math for business,math for business,business math,probability,statistics,fordham,fordham university,permuation,combination,n choose r,