Combinations Explained
Combinations
A combination is the number of arrangements possible when order does not matter.
- Example: Choosing outfits where the order of putting on clothes (shirt before pants or vice versa) doesn't change the outfit.
The term "combination lock" is actually a misnomer since the order of numbers matters; it should be called a permutation lock.
Formula and Nomenclature
The mathematical notation for combinations is , where:
- = the number of distinct objects.
- = the number of objects taken.
The formula for calculating combinations is: , where "!" denotes the factorial.
Example Problem: Vegetable Medley
Problem: Mister Rogers wants to make a vegetable medley for his family reunion using beets, carrots, tofu, daikon, and onions but can only use three ingredients.
Identify and :
- (five distinct vegetables available).
- (choosing three vegetables for the medley).
Apply the formula:
Step-by-step Calculation
- Expand the factorials:
- Substitute into the formula:
- Simplify:
- Cancel out common factors (e.g., ):
- Calculate:
- Result: There are 10 different combinations of vegetable medleys Mister Rogers can make using three out of the five available ingredients.
Listing Combinations
- Examples of combinations:
- Beet, tofu…
- Carrot, tofu, daikon…
- Tofu, daikon, and onion…
- Listing all combinations would result in 10 different varieties.
- Example of a combination that might be chosen: beet, daikon, and carrots.