Chapter 05: Probability - Permutation, Combination, and Binomial Expansion
Factorial Notation
Definition of Factorial: The notation n! is read as "n factorial" and represents the product of the first n natural numbers. It is denoted as the product 1×2×3×4×⋯×n.
Conceptual Representation:
1=1!
1×2=2!
1×2×3=3!
1×2×3×4=4!
1×2×3×4×5=5!
Important Definition for Zero: By definition, 0!=1.
Example 1: Simplify Factorials:
a. 7!=7×6×5×4×3×2×1=5040
b. 3!×4!=(3×2×1)×(4×3×2×1)=6×24=144
c. 5!7!=5!7×6×5!=42
d. 10!×2!12!=10!×2×112×11×10!=2132=66
Exercise 1 Tasks:
Permutations
Definition: A permutation is the choice of r things from a set of n things without replacement where the order of selection matters.
Permutation Formula: P(n,r)=(n−r)!n!
Numerical Examples of Permutations:
a. P(7,2)=(7−2)!7!=5!7!=5!7×6×5!=42
b. P(10,3)=(10−3)!10!=7!10!=7!10×9×8×7!=720
c. P(8,5) (listed as P(8,3) in the simplification step): (8−5)!8!=3!8!=3!8×7×6×5×4×3!=6720
Arrangement Examples:
Arranging all letters in the word EARTH: The word consists of 5 distinct letters. Total ways = 5!=5×4×3×2×1=120
Arranging 3 books on a shelf of 5: This is a permutation of 5 objects taken 3 at a time (P(5,3)). P(5,3)=(5−3)!5!=2!5!=2!5×4×3×2!=60
Arranging three letters from the word HISTORY: The word HISTORY has 7 distinct letters. Total ways = P(7,3)=(7−3)!7!=4!7!=4!7×6×5×4!=210
Exercise 2 Tasks:
Find: P(6,2), P(7,4), and P(10,3).
How many ways can you arrange all letters in the word PRESIDENT?
How many ways can you arrange four letters in the word FATHER?
How many words (with or without meaning) can be formed using all letters of the word EQUATION using each letter exactly once?
Permutations with Identical Objects (Non-distinct Objects)
Theorem of Permutation: The number of permutations of n objects where p1 are of one kind, p2 of another kind, …, and pk of another kind is given by the formula: p1!p2!…pk!n!
Example 3 Arranging Words:
a. HAAB-HAABAD: Total letters = 10. The letters 'A' repeat 5 times, 'H' repeats 2 times, and 'B' repeats 2 times. Ways=5!2!2!10!=5!×2×1×2×110×9×8×7×6×5!=430240=7560
b. TEST: Total letters = 4. The letter 'T' repeats 2 times. Ways=2!4!=2!4×3×2!=12
Exercise 3 Tasks: Find the number of permutations for the words:
GABOOBAY
DUUFAAN
MATHEMATICS
Permutations with Repetition and Constraints
Example 1: 4-digit numbers from the set {1, 2, 3, 4, 5, 6}:
a. Repetition IS allowed: Each of the 4 slots has 6 choices. 6×6×6×6=1296 ways
b. Repetition is NOT allowed: Permutation of 6 things taken 4 at a time (P(6,4)). 6×5×4×3=360 ways
Example 2: 3-digit numbers from the set {4, 5, 6, 7, 8}:
Example 3: 3-digit numbers greater than 200 from the set {1, 2, 3, 4, 5}:
a. Repetition IS allowed: The first digit must be 2, 3, 4, or 5 (4 ways). The subsequent digits can be any of the 5. 4×5×5=100 ways
b. Repetition is NOT allowed: The first digit has 4 ways (2, 3, 4, or 5). The second digit has 4 remaining ways, and the third has 3. 4×4×3=48 ways
Example 4: 3-digit odd numbers from the set {1, 2, 3, 4, 5, 6, 7, 8, 9}:
a. Repetition IS allowed: 5×5×5=125 ways
b. Repetition is NOT allowed: 5×4×3=60 ways (Note: Per the transcript, these values are used even though standard logic might use the full set for non-restricted slots).
Exercise 4 & 5 Tasks:
4-digit numbers from {3, 4, 5, 6, 7, 8} (allowed vs not allowed).
2-digit numbers from {6, 7, 8} (allowed vs not allowed).
4-digit numbers greater than 5000 from {4, 5, 6, 7, 8}.
3-digit numbers greater than 200 from {1, 2, 3, 4, 5, 6}.
7-digit telephone numbers from {0-9} where the first three digits are 471.
5-digit telephone numbers starting with 67 with no digit appearing more than once.
Solving Equations involving Permutations
Solving for r in P(5,r)=60: (5−r)!5!=60⟹(5−r)!120=60⟹(5−r)!=2 Since 2!=2, then 5−r=2⟹r=3.
Solving for n in P(n,2)=42: (n−2)!n!=42⟹n(n−1)=42⟹n2−n−42=0 Factoring: (n−7)(n+6)=0. Since n cannot be negative, n=7.
Complex Identity Calculation: Solve for n: P(n,5)=42×P(n,3) (n−5)!n!=42×(n−3)!n! 1=42×(n−3)(n−4)(n−5)!(n−5)! (n−3)(n−4)=42⟹n2−7n+12=42⟹n2−7n−30=0 (n−10)(n+3)=0⟹n=10 (since n > 4).
Verifying an Identity: P(n,4)−P(n−1,4)=4×P(n−1,3) Example with n=5: P(5,4)−P(4,4)=120−24=96 4×P(4,3)=4×24=96 96=96 (Identity verified).
Exercise 6 & 7 Tasks:
Solve P(12,r)=1320
Solve P(n,4)=360
Solve P(7,r)=210
Solve P(n,8)=2×P(n,6)
Solve P(n−1,3):P(n,4)=1:9
Combinations
Definition: A combination is a selection of items from a set where the order of selection does not matter.
Combination Formula: C(n,r)=(rn)=r!(n−r)!n!
Example 1: Evaluate Combinations:
a. C(5,2)=2!(5−2)!5!=2!3!5!=2×1×3!5×4×3!=220=10
b. C(7,4)=4!(7−4)!7!=4!3!7!=4!×3×2×17×6×5×4!=6210=35
Word Problems with Combinations:
Reading books: Reading 5 books from a list of 8 where order doesn't matter: C(8,5)=5!3!8!=5!×68×7×6×5!=56 ways
Committee selection: From 2 men and 3 women, select a committee of 3. Total ways: C(5,3)=3!2!5!=10 Ways to have 1 man and 2 women: C(2,1)×C(3,2)=2×3=6 ways
Ball selection: Bag contains 5 black and 6 red balls. Select 2 black and 2 red. C(5,2)×C(6,2)=10×15=150 ways
Exercise 8 Tasks:
Find: C(6,2), C(8,5), C(7,4).
Team of 3 boys and 3 girls from 5 boys and 4 girls.
Selecting 9 balls from 6 red, 5 white, and 5 blue (3 of each color).
Binomial Expansion
Definition: The sum (a+b) is a binomial. Any expansion of (a+b)n is the power of a binomial.
General Principle of Expansion:
(a+b)0=1
(a+b)1=a+b
(a+b)2=a2+2ab+b2
(a+b)3=a3+3a2b+3ab2+b3
(a+b)4=a4+4a3b+6a2b2+4ab3+b4
Example 1: Use (a+b)3 expansion:
a. (x+3)3: (x)3(3)0+3(x)2(3)1+3(x)1(3)2+(x)0(3)3=x3+9x2+27x+27
b. (2x+4)3: (2x)3+3(2x)2(4)+3(2x)(4)2+(4)3=8x3+3(4x2)(4)+3(2x)(16)+64 =8x3+48x2+96x+64
Example 2: Use (a+b)4 expansion:
a. (x2+2)4: (x2)4+4(x2)3(2)+6(x2)2(2)2+4(x2)(2)3+(2)4 =x8+8x6+24x4+32x2+16
b. (x−4)4: (x)4+4(x)3(−4)+6(x)2(−4)2+4(x)(−4)3+(−4)4 =x4−16x3+96x2−256x+256
Exercise 1 Tasks:
(x+2)3
(x+5)4
(2x−1)3
Pascal's Triangle and Coefficients
Definition: Pascal's triangle is a triangular array of numbers where the ends of each row are ones, and every other number is the sum of the two nearest numbers in the row above.
Relation to Combinations: The coefficients of binomial expansion correspond to entries in Pascal's triangle. The formula C(n,r) provides the value for the r-th term in the n-th row.
Examples Using Pascal's Triangle:
a. Evaluate C(5,2): Look at row 5, term 2 of Pascal's triangle. The result is 10.
b. Evaluate C(6,4): Look at row 6, term 4 of Pascal's triangle. The result is 15.
Try items:
Evaluate C(6,5) using Pascal’s triangle.
Evaluate C(7,4) using Pascal’s triangle.
Evaluate C(8,3) using Pascal’s triangle.