Khan Academy provides a beginner-friendly path into understanding permutations and combinations, two foundational ideas in probability and counting. These concepts help you calculate possible outcomes systematically and are widely used in statistics, computer science, and decision making.
Below is a structured overview of core topics and relationships in permutations and combinations covered on Khan Academy, designed for quick scanning and practical reference.
| Topic | Key Idea | Formula | When to Use |
|---|---|---|---|
| Factorial | Product of all positive integers up to n | n! = n × (n−1) × ... × 1 | Building blocks for permutations and combinations |
| Permutation | Ordered arrangements of items | P(n, r) = n! / (n−r)! | Order matters, e.g., ranking winners |
| Combination | Selections where order does not matter | C(n, r) = n! / [r!(n−r)!] | Choosing groups, e.g., committees or teams |
| Complementary Counting | Count what you do not want to simplify problems | Total − Unwanted = Wanted | Easier than direct counting in complex cases |
Permutations Order Matters
Definition and Intuition
Permutations focus on ordered arrangements, where the sequence of items changes the outcome. On Khan Academy, you learn to distinguish permutations from combinations by asking whether swapping positions creates a new outcome.
Formula and Examples
The formula P(n, r) = n! / (n−r)! lets you compute the number of ways to arrange r items from a set of n distinct items. Khan Academy walks through examples such as assigning gold, silver, and bronze medals to contestants, highlighting how order influences the count.
Combinations Order Does Not Matter
Definition and Intuition
Combinations count distinct groups regardless of sequence, so {A, B} is considered the same as {B, A}. This concept appears frequently in probability problems involving committees, handshakes, or lottery-style selections.
Formula and Examples
The combination formula C(n, r) = n! / [r!(n−r)!] removes ordering from the permutation count by dividing out r!. Khan Academy emphasizes interpreting factorial expressions and simplifying large calculations with factorial cancellation.
Problem Solving Strategies
Step by Step Approach
Effective problem solving with permutations and combinations involves clearly defining n and r, deciding whether order matters, choosing the correct model, and verifying results through complementary counting when appropriate. Khan Academy structures practice to reinforce these steps.
Avoiding Common Mistakes
Learners often confuse when to use permutations versus combinations, miscount by over- or undercounting, or mishandle restrictions such as adjacency or exclusion. Structured drills on Khan Academy help identify and correct these patterns.
Building Intuition and Mastery
- Start by clearly labeling n (total items) and r (items selected) in every problem.
- Practice deciding whether order matters before writing any formula.
- Work through small examples by listing outcomes to verify your calculations.
- Use complementary counting when direct counting involves many overlapping cases.
- Review mistakes by re-doing problems with a different strategy to deepen understanding.
FAQ
Reader questions
How do I know whether order matters in a problem?
Ask yourself if changing the position or sequence of selected items creates a new, distinct outcome. If yes, use permutations; if no, use combinations.
Can I use permutations and combinations together in one problem?
Yes, many advanced problems require both concepts, such as selecting a group with specific ordered roles or splitting a set into ordered and unordered parts.
What should I do when items cannot repeat?
Reduce n by the number of items already chosen at each stage and apply the appropriate permutation or combination formula, since each selection changes the available pool.
How can complementary counting simplify difficult problems?
Instead of counting the desired outcomes directly, calculate the total possibilities and subtract the unwanted ones, often turning a complex case into a single, simpler calculation.