1. Multiplication Principle (Fundamental Counting Principle)
The Multiplication Principle is used to find the total number of outcomes of a sequence of events.
-
Rule: If an operation can be performed in m ways and a second operation in n ways, then the total number of ways both can occur is:
Total ways=m×n
-
Example:
- A shirt can be red or blue (2 options) and pants can be black or white (2 options).
- Total outfits = 2×2=4
-
Extension: For k operations with n1,n2,...,nk ways:
Total ways=n1×n2×...×nk
2. Permutation
Permutation refers to the arrangement of objects in a specific order.
Order matters in permutation.
Formulas
-
Permutation of n distinct objects (all objects):
Pn=n!=n⋅(n−1)⋅(n−2)⋯1
-
Permutation of r objects out of n (ordered selection):
P(n,r)=(n−r)!n!
- Example: How many ways can 3 students be seated in 5 chairs?
P(5,3)=(5−3)!5!=2120=60
- Permutation with repetition (if some objects are identical):
Total arrangements=p1!,p2!,...,pk!n!
- Where p1,p2,...,pk are counts of identical objects.
- Example: ARRANGE letters in "LEVEL" → 5!/(2!2!)=30
3. Combination
Combination refers to selection of objects where order does not matter.
Formula
C(n,r)=(rn)=r!(n−r)!n!
- Example: How many ways to choose 3 students from 5?
C(5,3)=3!2!5!=6⋅2120=10
Relationship Between Permutation and Combination
P(n,r)=C(n,r)⋅r!
- Because each combination of r objects can be arranged in r! ways.
Quick Tips to Remember
| Concept |
Order Important? |
Formula |
Example |
| Multiplication Principle |
N/A |
Multiply options |
Shirt & pants |
| Permutation |
Yes |
P(n,r)=n!/(n−r)! |
Seats, races |
| Combination |
No |
C(n,r)=n!/(r!(n−r)!) |
Teams, committees |
Key Points
- Use Multiplication Principle when counting sequences of independent events.
- Use Permutations when arrangement matters.
- Use Combinations when only selection matters.
- Remember: P(n,r)=C(n,r)⋅r!