Aptitude · Quantitative aptitude

Permutations and combinations

Permutations when order matters, combinations when it doesn't.

Formulas and shortcuts

  • nPr = n!/(n − r)!; nCr = n!/(r!(n − r)!).
  • Arrangements of a word with repeated letters: n! divided by the factorial of each letter's count.
  • "At least one" = all ways − the ways with none.
  • Two who must sit together: treat them as one unit, then × 2 for their order.

Solved examples

  1. In how many ways can a committee of 2 be chosen from 8 people?

    • A. 28
    • B. 56
    • C. 16
    • D. 8

    Answer: A. 28

    • Order doesn't matter, so it's a combination: 8C2 = 8! / (2! × 6!) = 28.
  2. In how many different ways can the letters of the word MAMMAL be arranged?

    • A. 720
    • B. 120
    • C. 60
    • D. 30

    Answer: C. 60

    • 6 letters, with M 3 times, A 2 times.
    • 6! / (3! × 2!) = 60.
  3. From 6 men and 4 women, a team of 4 is to be chosen with at least one woman. In how many ways can this be done?

    • A. 210
    • B. 1
    • C. 336
    • D. 195

    Answer: D. 195

    • All teams: 10C4 = 210. Teams with no woman: 6C4 = 15.
    • At least one woman: 210 − 15 = 195.
  4. In how many ways can 5 friends sit in a row if two of them insist on sitting together?

    • A. 120
    • B. 72
    • C. 24
    • D. 48

    Answer: D. 48

    • Tie the two together as one unit: 4 units can be arranged in 4! = 24 ways.
    • The two can swap places inside the unit: × 2 = 48.

Practise: 10 questions, 15 minutes

A new set every time, with every answer worked out at the end.

SectionQuestionsTime
Permutations and combinations1015 min

Every attempt is a new set of questions. No negative marking.

More quantitative aptitude