Fatskills
Practice. Master. Repeat.
Study Guide: GATE GA General Aptitude Numerical Ability Permutations and Combinations
Source: https://www.fatskills.com/gate-ga-general-aptitude/chapter/gate-ga-general-aptitude-numerical-ability-permutations-and-combinations

GATE GA General Aptitude Numerical Ability Permutations and Combinations

By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.

⏱️ ~5 min read

What Is This?

Permutations and Combinations are mathematical concepts dealing with the arrangement and selection of objects. Permutations involve arranging objects in a specific order, while combinations involve selecting objects without considering the order. This topic appears in exams to test your ability to solve problems involving counting and probability.

Why It Matters

Permutations and combinations are tested in various competitive exams such as GRE, GMAT, SAT, and job-related tests for roles in data analysis, finance, and engineering. They typically appear in 10-20% of the questions and can carry significant marks. This topic tests your logical reasoning and problem-solving skills.

Core Concepts

  1. Permutations: Arranging all or some of the objects in a specific order.
  2. Combinations: Selecting objects without considering the order.
  3. Factorial: The product of all positive integers up to a given number (n!).
  4. Repetition: Permutations and combinations with or without repetition.
  5. Distinction: Understanding when order matters (permutations) vs. when it does not (combinations).

Prerequisites

  1. Basic Arithmetic: Understanding of multiplication and division.
  2. Factorials: Knowing how to calculate factorials (n!).
  3. Probability Basics: Awareness of basic probability concepts.

The Rule-Book (How It Works)


Permutations

  • Primary Rule: The number of permutations of n distinct objects taken r at a time is given by: [ P(n, r) = \frac{n!}{(n-r)!} ]
  • Sub-rules:
  • If all objects are distinct: ( P(n, n) = n! )
  • If repetition is allowed: ( P(n, r) = n^r )

Combinations

  • Primary Rule: The number of combinations of n distinct objects taken r at a time is given by: [ C(n, r) = \frac{n!}{r!(n-r)!} ]
  • Sub-rules:
  • If repetition is allowed: ( C(n+r-1, r) )

Mnemonic

  • Permutations: "Order Matters"
  • Combinations: "Order Doesn't Matter"

Exam / Job / Audit Weighting

  • Frequency: Moderate (10-20% of questions)
  • Difficulty Rating: Intermediate
  • Question Type: Multiple Choice, True/False, Problem-Solving

Difficulty Level

Intermediate

Must-Know Rules, Formulas, Standards, or Principles

  1. Permutations Formula: ( P(n, r) = \frac{n!}{(n-r)!} )
  2. Combinations Formula: ( C(n, r) = \frac{n!}{r!(n-r)!} )
  3. Factorial Rule: ( n! = n \times (n-1) \times (n-2) \times \ldots \times 1 )

Worked Examples (Step-by-Step)


Easy

Question: How many ways can you arrange 3 distinct books on a shelf? Solution: 1. Identify the number of books (n = 3).
2. Use the permutation formula for distinct objects: ( P(3, 3) = 3! ) 3. Calculate: ( 3! = 3 \times 2 \times 1 = 6 ) Answer: 6 ways

Medium

Question: In how many ways can you select 2 fruits from a basket of 5 different fruits? Solution: 1. Identify the number of fruits (n = 5) and the number to select (r = 2).
2. Use the combination formula: ( C(5, 2) = \frac{5!}{2!(5-2)!} ) 3. Calculate: ( C(5, 2) = \frac{5 \times 4}{2 \times 1} = 10 ) Answer: 10 ways

Hard

Question: How many different 4-letter words can be formed using the letters A, B, C, D with repetition allowed? Solution: 1. Identify the number of letters (n = 4) and the length of the word (r = 4).
2. Use the permutation formula with repetition: ( P(4, 4) = 4^4 ) 3. Calculate: ( 4^4 = 256 ) Answer: 256 words

Common Exam Traps & Mistakes

  1. Mistake: Confusing permutations with combinations.
  2. Wrong Answer: Using combination formula for permutation problems.
  3. Correct Approach: Check if the order matters.

  4. Mistake: Forgetting to adjust for repetition.

  5. Wrong Answer: Using ( n! ) instead of ( n^r ) for permutations with repetition.
  6. Correct Approach: Identify if repetition is allowed.

  7. Mistake: Incorrect factorial calculation.

  8. Wrong Answer: ( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 110 )
  9. Correct Approach: Double-check factorial calculations.

  10. Mistake: Not simplifying combinations correctly.

  11. Wrong Answer: ( C(5, 2) = \frac{5!}{2!(5-2)!} = \frac{120}{2 \times 3!} = 15 )
  12. Correct Approach: Simplify step-by-step.

Shortcut Strategies & Exam Hacks

  1. Memory Aid: Remember "P for Permutations" and "C for Combinations".
  2. Elimination Strategy: If the question involves order, eliminate combination options.
  3. Pattern Recognition: Identify repetition keywords like "with repetition" or "allowing repetition".
  4. Formula Shortcut: Memorize ( P(n, r) = \frac{n!}{(n-r)!} ) and ( C(n, r) = \frac{n!}{r!(n-r)!} ).

Question-Type Taxonomy

  1. Multiple Choice: Select the correct number of arrangements or selections.
  2. Example: How many ways can you arrange 4 distinct objects?
  3. Exams: GRE, GMAT

  4. True/False: Identify if a given statement about permutations or combinations is correct.

  5. Example: The number of ways to select 3 items from 5 is 60.
  6. Exams: SAT, Job Tests

  7. Problem-Solving: Solve a real-world problem using permutations or combinations.

  8. Example: How many different license plates can be made with 3 letters and 3 digits?
  9. Exams: Engineering, Data Analysis

Practice Set (MCQs)

  1. Question: How many ways can you arrange 4 distinct books on a shelf?
  2. Options: A) 12, B) 24, C) 48, D) 96
  3. Correct Answer: B) 24
  4. Explanation: Use ( P(4, 4) = 4! = 24 )
  5. Why the Distractors Are Tempting: A) Confusion with combinations, C) and D) Incorrect factorial calculations.

  6. Question: In how many ways can you select 3 fruits from a basket of 6 different fruits?

  7. Options: A) 15, B) 20, C) 30, D) 40
  8. Correct Answer: B) 20
  9. Explanation: Use ( C(6, 3) = \frac{6!}{3!(6-3)!} = 20 )
  10. Why the Distractors Are Tempting: A) and C) Incorrect combination calculations, D) Confusion with permutations.

  11. Question: How many different 3-letter words can be formed using the letters A, B, C with repetition allowed?

  12. Options: A) 9, B) 27, C) 81, D) 243
  13. Correct Answer: B) 27
  14. Explanation: Use ( P(3, 3) = 3^3 = 27 )
  15. Why the Distractors Are Tempting: A) and C) Incorrect permutation calculations, D) Confusion with combinations.

  16. Question: How many ways can you arrange 5 distinct objects taken 3 at a time?

  17. Options: A) 30, B) 60, C) 120, D) 180
  18. Correct Answer: B) 60
  19. Explanation: Use ( P(5, 3) = \frac{5!}{(5-3)!} = 60 )
  20. Why the Distractors Are Tempting: A) and C) Incorrect permutation calculations, D) Confusion with combinations.

  21. Question: In how many ways can you select 4 items from 8 distinct items?

  22. Options: A) 56, B) 70, C) 168, D) 210
  23. Correct Answer: B) 70
  24. Explanation: Use ( C(8, 4) = \frac{8!}{4!(8-4)!} = 70 )
  25. Why the Distractors Are Tempting: A) and C) Incorrect combination calculations, D) Confusion with permutations.

30-Second Cheat Sheet

  • Permutations: ( P(n, r) = \frac{n!}{(n-r)!} )
  • Combinations: ( C(n, r) = \frac{n!}{r!(n-r)!} )
  • Factorial: ( n! = n \times (n-1) \times (n-2) \times \ldots \times 1 )
  • Order Matters: Permutations
  • Order Doesn't Matter: Combinations
  • Repetition Allowed: ( P(n, r) = n^r )
  • Repetition in Combinations: ( C(n+r-1, r) )

Learning Path

  1. Beginner Foundation: Understand basic arithmetic and factorials.
  2. Core Rules: Learn permutations and combinations formulas.
  3. Practice: Solve easy to medium difficulty problems.
  4. Timed Drills: Practice under exam conditions.
  5. Mock Tests: Take full-length mock exams.

Related Topics

  1. Probability: Permutations and combinations are foundational for probability calculations.
  2. Statistics: Understanding distributions and sampling often involves permutations and combinations.
  3. Algorithms: Sorting and searching algorithms often rely on permutations and combinations.


ADVERTISEMENT