Permutation and Combination

Permutation and Combination Data Sufficiency problems test your ability to determine if given statements provide enough information to count arrangements, selections, or combinatorial possibilities. You must assess sufficiency using factorial formulas and combinatorial reasoning.

10Worksheets
200+Practice Questions
HardDifficulty
3-4 hoursHours to Master

Introduction to Permutation and Combination

Permutation and Combination Data Sufficiency problems test your ability to determine if given statements provide enough information to count arrangements, selections, or combinatorial possibilities. You must assess sufficiency using factorial formulas and combinatorial reasoning.

Prerequisites

Permutation formula: nPr = n!/(n-r)! Combination formula: nCr = n!/(r!(n-r)!) Fundamental counting principle Factorial concept
Why This Matters: Permutation and Combination appear in 1-2 questions in CAT and GMAT exams. They test combinatorial reasoning and sufficiency analysis.

How to Solve Permutation and Combination Problems

1

Step 1: Identify what is being asked (number of arrangements, selections, etc.)

2

Step 2: Translate each statement into counting conditions

3

Step 3: Check if Statement (1) alone gives a unique answer

4

Step 4: Check if Statement (2) alone gives a unique answer

5

Step 5: Combine statements if needed

6

Step 6: Remember that n must be known to calculate nPr or nCr

7

Step 7: Select the appropriate DS answer choice

Pro Strategy: To find number of permutations, need the total number of items and any repetitions. To find number of combinations, need total items and selection size.

Example Problem

Example: In how many ways can the letters of the word be arranged? Statement (1): The word has 5 distinct letters. Statement (2): The word has 2 vowels and 3 consonants. Solution: Step 1: Question asks for number of arrangements Step 2: Statement (1): 5 distinct letters → 5! = 120 ways → SUFFICIENT alone Step 3: Statement (2): 2 vowels and 3 consonants, but letters may not be distinct → need to know if letters are distinct or repeated → NOT sufficient alone Answer: Statement (1) alone is sufficient

Pro Tips & Tricks

  • Number of permutations of n distinct items = n!
  • Number of permutations with repetition = n!/(a!b!...) where a,b are repetition counts
  • Number of combinations of n items taken r at a time = nCr
  • To find nCr, need n and r
  • Arrangements with restrictions need additional information
  • Circular permutations = (n-1)!

Shortcut Methods to Solve Faster

n distinct items → n! permutations
nPr = n!/(n-r)! → need n and r
nCr = n!/(r!(n-r)!) → need n and r
If nPr given as number, can solve for n if r known
If nCr given as number, may have two possible n values

Common Mistakes to Avoid

Assuming n is known from ratio of factorials (may have multiple solutions)
Confusing permutations with combinations
Forgetting to account for repetitions
Assuming distinct items when not stated

Exam Importance

Permutation and Combination is an important topic for various competitive exams. Here's how frequently it appears:

CAT
1-2 questions
GMAT
1-2 questions
BANKING PO
0-1 questions
SSC CGL
0-1 questions
INSURANCE
0-1 questions

Ready to Master Permutation and Combination?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now