Summary
Highlights
The video starts by defining permutations as arrangements where order matters, and combinations as selections where order does not matter. An example with letters A, B, C illustrates that ABC and CAB are two different permutations but only one combination.
Using four letters (A, B, C, D), the video demonstrates how to manually list all possible permutations (12) and combinations (6) when choosing two letters. This concrete example highlights the distinction that AB and BA are separate permutations but the same combination.
The video introduces the formula for permutations, nPr = n! / (n-r)!, and applies it to the previous example of 4P2, yielding 12. Subsequently, it presents the formula for combinations, nCr = n! / ((n-r)! * r!), demonstrating its application for 4C2, which results in 6.
A problem asks how many ways three books can be arranged from a group of seven. Recognizing 'arrange' as a keyword for permutation, the calculation is 7P3 = 7! / (7-3)! = 210 ways.
This problem involves arranging five books on a shelf. It's a permutation because order matters. The fundamental counting principle (5 * 4 * 3 * 2 * 1 = 120) and the permutation formula (5P5 = 5! / (5-5)! = 5! / 0! = 120) are both used, highlighting that 0! equals 1.
The task is to determine how many teams of four can be formed from 12 engineers. Since the order of individuals in a team doesn't matter, this is a combination problem. The calculation 12C4 = 12! / (8! * 4!) is performed, resulting in 495 possible teams.
This section covers permutations with repeating letters, using the word 'Alabama'. There are 7 letters in total, with 'a' repeating 4 times. The calculation is 7! / 4! = 210 unique arrangements.
The final example involves arranging the letters in 'Mississippi'. With 11 letters, and 'i' repeating 4 times, 's' 4 times, and 'p' 2 times, the calculation is 11! / (4! * 4! * 2!), which results in 34,650 unique arrangements.