Khan Academy offers a clear, beginner friendly path into counting and probability, with combinations and permutations lessons that show how to count outcomes in real situations. Learners often start by distinguishing ordered arrangements from unordered selections, building intuition for more advanced statistics and data science topics.
The table below summarizes core ideas, formulas, notation, and typical use cases you will meet when studying combinations and permutations on Khan Academy.
| Topic | Formula | Key Idea | When to Use |
|---|---|---|---|
| Permutations (ordered) | P(n, r) = n! / (n − r)! | Sequence matters | Rankings, passwords, race results |
| Combinations (unordered) | C(n, r) = n! / (r!(n − r)!) | Selection only | Committees, pizza toppings, card hands |
| Factorial growth | n! = n × (n − 1) × … × 1 | Rapid growth in outcomes | Understanding why exact counting matters |
| Real world links | Counting → Probability | Count favorable over total | Risk assessment, games, simulations |
Permutations where order matters
In this section, you learn to count sequences in which the arrangement changes the outcome. Khan Academy walks through examples such as lining people up, assigning roles, and creating multi digit codes.
The permutation formula P(n, r) = n! / (n − r)! captures how many ways you can choose and order r items from a set of n items. Lessons emphasize interpreting the formula, simplifying factorials, and avoiding common overcounting mistakes.
Combinations where order does not matter
Here you focus on choosing groups, not sequences. Khan Academy explains combinations with clear examples, such as forming committees, selecting songs for a playlist, or choosing poker cards.
The combination formula C(n, r) = n! / (r!(n − r)!) removes the duplicate counts that would arise if you treated different orders as different selections. You practice recognizing whether a problem needs combinations instead of permutations.
Problem solving strategies and notation
Beyond formulas, Khan Academy builds a flexible toolkit for tackling word problems involving combinations and permutations. You learn to break down the story, label n and r, decide order sensitivity, and choose the correct method.
Clear notation, step by step plans, and connection to probability help you move from isolated exercises to reliable problem solving habits in varied contexts.
Applying counting to probability and statistics
Counting methods directly support probability calculations, where favorable outcomes are divided by total possible outcomes. Khan Academy links combinations and permutations to events such as card draws, dice rolls, and lottery scenarios.
You practice constructing sample spaces, identifying equally likely outcomes, and using complements to simplify complex probability questions.
Key takeaways for mastering combinations and permutations
- Distinguish ordered problems (permutations) from unordered problems (combinations)
- Memorize and correctly apply P(n, r) and C(n, r) formulas
- Interpret factorial notation and simplify without calculating huge numbers
- Use step by step plans to model real world scenarios
- Connect counting methods to probability for more complex problem solving
FAQ
Reader questions
How do I know whether to use permutations or combinations in a word problem?
Ask whether changing the order of selected items creates a new outcome. If yes, use permutations; if no, use combinations. Look for keywords like arrangements, rankings, or sequences for permutations, and groups, committees, or subsets for combinations.
Can Khan Academy combinations and permutations lessons help with standardized test questions?
Yes, the lessons include realistic test style questions, practice drills, and hints that build the specific skills commonly assessed in math sections of exams and college courses.
What should I do if my count seems much larger than expected in a permutations problem?
Check whether order truly matters and whether you have overcounted by treating similar arrangements as distinct. Simplify factorials step by step and compare your result to smaller cases you can enumerate manually.
How are combinations and permutations connected to probability calculations on Khan Academy?
Once you can count outcomes accurately, probability becomes favorable counts divided by total counts. Khan Academy guides you through this link with worked examples, tree diagrams, and simulations.