Calculate permutations (nPr), combinations (nCr), and factorials with detailed step-by-step solutions. Perfect for combinatorics problems, probability calculations, and mathematical analysis.
Permutations and combinations are fundamental concepts in combinatorics, the branch of mathematics dealing with counting, arrangement, and selection. These concepts are essential for solving problems in probability, statistics, computer science, and many real-world applications involving arrangements and selections.
Understanding the difference between permutations and combinations is crucial: permutations consider order important, while combinations do not. This distinction determines which formula to use for different types of counting problems.
Number of ways to arrange r items from n items (order matters)
Number of ways to choose r items from n items (order doesn't matter)
Product of all positive integers from 1 to n
Problem Type | Use | Formula | Example |
---|---|---|---|
Arranging objects in order | Permutation | nPr | Seating arrangements |
Selecting without order | Combination | nCr | Choosing committee members |
Password creation | Permutation | nPr | Different letter orders matter |
Lottery number selection | Combination | nCr | Order drawn doesn't matter |
Race finishing positions | Permutation | nPr | 1st, 2nd, 3rd place different |
Pizza topping selection | Combination | nCr | Order of selection irrelevant |
Definition: n! = n × (n-1) × (n-2) × ... × 2 × 1
Special Cases:
Permutation Example: How many ways can 5 people be arranged in 3 chairs?
5P3 = 5! / (5-3)! = 5! / 2! = 120 / 2 = 60 ways
Combination Example: How many ways can 3 people be chosen from 5?
5C3 = 5! / (3! × 2!) = 120 / (6 × 2) = 120 / 12 = 10 ways
Field | Application | Type Used | Why |
---|---|---|---|
Computer Science | Algorithm analysis | Both | Complexity calculations |
Probability | Event counting | Both | Calculating likelihood |
Genetics | DNA sequence analysis | Permutation | Order of bases matters |
Quality Control | Sample selection | Combination | Order of selection irrelevant |
Cryptography | Key generation | Permutation | Order affects security |
Game Theory | Strategy combinations | Both | Depends on game rules |
Key Relationship: nPr = nCr × r!
This makes sense because:
Pascal's Triangle displays combination values:
Row n contains the values nC0, nC1, nC2, ..., nCn
Each number is the sum of the two numbers above it
Combination Properties:
Permutation Properties:
Step 1: Identify if order matters
Step 2: Identify n (total items) and r (items to select/arrange)
Step 3: Apply the appropriate formula
Step 4: Verify your answer makes sense
Repetition Allowed:
Circular Permutations: (n-1)! ways to arrange n objects in a circle
Multiset Permutations: n! / (n₁! × n₂! × ... × nₖ!) for objects with repetitions