Khan Academy provides a clear, self-paced introduction to combinations and permutations, helping learners understand how to count possible outcomes in everyday situations. These foundational ideas support progress in probability, statistics, and computer science.
Whether you are preparing for exams or strengthening logical thinking, this guide explains key distinctions, problem-solving strategies, and practice tips using structured tables and examples.
Permutations vs Combinations Overview Table
| Aspect | Permutations | Combinations | When to Use |
|---|---|---|---|
| Order Matters | Yes | No | Arrangements, rankings, passwords |
| Formula | nPr = n! / (n - r)! | nCr = n! / [r!(n - r)!] | Selections, committees, groups |
| Example (n=5, r=3) | 60 ordered options | 10 unordered groups | Compare requirements before choosing |
| Growth Rate | Faster increase | Slower increase | Larger r increases both but amplifies permutations |
Fundamental Counting Principles
Basic Rules and Examples
The fundamental counting principle states that if one event has m possible outcomes and a second event has n possible outcomes, then the combined events have m × n total outcomes. Khan Academy walks through clear examples such as choosing meals from menus or outfits from drawers to build intuition.
Connecting to Factorials
Factorials grow quickly and become the backbone of permutation and combination formulas. Understanding n! as the number of ways to arrange n distinct items helps learners transition smoothly into more advanced problems involving subsets and restrictions.
How to Calculate Permutations
Formula and Step-by-Step Approach
To compute permutations, use nPr = n! / (n - r)!, where n is the total number of items and r is the number chosen. Khan Academy emphasizes labeling the pool and the selection, then substituting into the formula and simplifying carefully.
Real-World Applications
Permutations model scenarios where sequence is important, such as race rankings, seating plans, and secure PIN codes. Learners practice distinguishing these from combination problems by asking whether rearranging the chosen items creates a new outcome.
How to Calculate Combinations
Combination Formula Explained
The combination formula nCr = n! / [r!(n - r)!] removes the ordering effect by dividing the permutation count by r!. This adjustment is useful when the group matters but not the sequence, such as forming project teams or lottery number selections.
Symmetry and Shortcuts
Remember that nCr equals nC(n - r), which can simplify calculations. Khan Academy problems often exploit this property to reduce computation and help learners recognize equivalent selection scenarios.
Problem-Solving Strategies and Practice
Identifying the Correct Method
Khan Academy trains learners to ask whether order matters, whether repetition is allowed, and whether the problem involves arranging or selecting. Answering these questions step by step reduces confusion and leads to the correct counting technique.
Common Pitfalls and How to Avoid Them
Mixing up permutations and combinations is a frequent challenge. Careful labeling, writing out small cases, and verifying answers with logical checks help build confidence and accuracy in solving more complex exercises.
Building Intuition and Long-Term Mastery
- Start with small, concrete examples and list outcomes manually.
- Clearly define the set of items and the selection size before applying formulas.
- Practice both permutation and combination problems to recognize key differences.
- Use tree diagrams or tables for very small cases to verify your reasoning.
- Review mistakes by recreating the logic step by step with Khan Academy hints.
- Apply combinations and permutations to real-life scenarios, such as scheduling or event planning.
FAQ
Reader questions
How do I know whether a problem requires permutations or combinations?
Determine if changing the order of selected items creates a new outcome. If yes, use permutations; if no, use combinations. Khan Academy problems highlight keywords such as arrangements (permutations) and groups (combinations) to guide this decision.
Can I use permutations or combinations when repetition is allowed?
Standard formulas assume no repetition. With repetition allowed, the counting rules change, such as using n^r for permutations with repetition. Khan Academy lessons clarify these variations and show adjusted approaches step by step.
What should I do if the problem involves both selections and arrangements? > Break the task into stages: first choose the subset using combinations, then arrange the chosen items using permutations. Multiply the counts at each stage to find the total number of possibilities. How can I practice effectively on Khan Academy to avoid common mistakes?
Work through simpler examples first, write down your reasoning, and compare your steps with the provided solutions. Focus on identifying whether order matters and whether items are replaced, then gradually tackle more complex multi-stage problems.