Chapter 6: Permutations and Combinations

Summary

• Introduction: Counting techniques to determine arrangements and selections without listing.
• Fundamental Principle of Counting: If an event can occur in m ways and another in n ways, total occurrences = m × n.
• Permutations:
  • For n different objects taken r at a time (no repetition):
    • Formula: nPr = n! / (n-r)!
  • With repetition: n^r.
• Combinations:
  • For n different objects taken r at a time:
    • Formula: nCr = n! / [r!(n-r)!].
• Historical Note: Concepts traced back to Jainism and significant contributions from mathematicians like Mahavira and Bhaskaracharya.

Key Formulas and Definitions

• Fundamental Principle of Counting: Total occurrences = m × n.
• Permutations (no repetition):
  • nPr = n! / (n-r)!
• Permutations (with repetition): n^r.
• Combinations:
  • nCr = n! / [r!(n-r)!].

Learning Objectives

• Understand the fundamental principle of counting.
• Apply permutations and combinations formulas to solve problems.
• Differentiate between permutations and combinations.
• Analyze historical contributions to the field of counting techniques.

Common Mistakes and Exam Tips

• Mistake: Confusing permutations with combinations; remember order matters in permutations.
• Tip: Carefully read the problem to identify if repetition is allowed or not.
• Tip: Use factorial notation correctly to simplify calculations.

Important Diagrams

• Tree Diagram: Illustrates possible outcomes for combinations of items (e.g., school bags, tiffin boxes, water bottles).
  • Main branches for each item type, further branching for choices.

Miscellaneous Exercises

1. How many words can be formed from the letters of the word DAUGHTER?
2. How many ways can a committee of 7 be formed from 9 boys and 4 girls?
3. In how many ways can 5 men and 4 women be seated in a row with women in even places?
4. Determine the number of 5-card combinations from a deck of 52 cards with specific conditions.

Chapter 6: Permutations and Combinations

6.1 Introduction

• Scenario: A suitcase with a number lock has 4 wheels, each labeled with digits 0-9.
• Problem: You remember the first digit (7) and need to find the number of sequences of the remaining 3 digits.
• Objective: Learn counting techniques to determine arrangements without listing.

6.2 Fundamental Principle of Counting

• Example: Mohan has 3 pants and 2 shirts.
  • Choices for pants: 3
  • Choices for shirts: 2
  • Total combinations: 3 x 2 = 6 pairs.

6.3 Permutations

6.3.1 Distinct Objects

• Theorem: Number of permutations of n different objects taken r at a time (no repetition) is given by:
  • Formula: nPr = n! / (n - r)!

6.3.2 Factorial Notation

• Definition: n! = n × (n - 1) × ... × 1
• Special Case: 0! = 1

6.4 Combinations

• Definition: A combination is a selection of items where order does not matter.
• Example: Choosing 2 players from 3 (X, Y, Z) results in:
  • Teams: XY, XZ, YZ (3 ways).

Miscellaneous Examples

• Example 1: Forming words from the letters of

Common Mistakes and Exam Tips

Common Pitfalls

• Misunderstanding Permutations vs. Combinations: Students often confuse when to use permutations (order matters) and combinations (order does not matter). Ensure clarity on the problem type before solving.
• Ignoring Restrictions: In problems with restrictions (e.g., no digit can be repeated), failing to account for these can lead to incorrect answers. Always read the problem carefully.
• Incorrect Application of Factorials: Students may misuse factorials, especially in problems involving arrangements. Remember that n! = n × (n-1) × ... × 1.
• Overlooking the Fundamental Principle of Counting: Forgetting to apply the multiplication principle can lead to undercounting possibilities. Always consider how many ways each choice can be made.

Tips for Success

• Practice with Examples: Work through various examples to solidify understanding of permutations and combinations. Use problems from the textbook or past exams.
• Draw Diagrams: For complex problems, drawing diagrams or using visual aids can help clarify the arrangement of items or choices.
• Check Your Work: After solving a problem, review your calculations and reasoning to ensure accuracy. Look for common mistakes mentioned above.
• Understand the Formulas: Familiarize yourself with key formulas for permutations and combinations, such as
  • Permutations: P(n, r) = n! / (n - r)!
  • Combinations: C(n, r) = n! / [r!(n - r)!]
• Time Management: During exams, allocate your time wisely. If a problem seems too complex, move on and return to it later if time permits.