NO MATH ANXIETY NON-ENGINEERS ONLY 100% CONCEPT CLARITY CRACK MBA LIKE A BOSS NO MATH ANXIETY NON-ENGINEERS ONLY 100% CONCEPT CLARITY CRACK MBA LIKE A BOSS
CAT & MBA CET MODERN MATH VAULT 🎯

COMBINATIONS FORMULAS & SHORTCUTS

Master Combinations for CAT, MBA CET, NMAT & SNAP. Learn selection rules, $^nC_r$ formulas, symmetry identities ($^nC_r = ^nC_{n-r}$), committee selection, and speed shortcuts designed for Non-Engineers.

ONE-LINE DEFINITION

What is a Combination?

A Combination is a selection of objects where the order DOES NOT matter. If changing the internal order of items produces the exact same group, it is a combination.

Does Order Matter? NO $\implies$ COMBINATION
💡 Example: Selecting a 3-person committee, choosing 11 cricket players, picking pizza toppings.
CORE INTUITION

Team Selection Mental Model

Suppose you need to select 3 students out of 5 (Alice, Bob, Charlie, David, Emma) for a presentation team.

Selection A: {Alice, Bob, Charlie}

Selection B: {Charlie, Alice, Bob}

Are these different groups? NO! The same 3 students are selected regardless of name order.

🎯 Key Principle: Group membership matters—not the order of naming.
WHY COMBINATIONS MATTER IN CAT & CET

Combinations are frequently tested in CAT, NMAT, SNAP, and XAT. They are essential for team selections, committee formations, geometry handshakes/diagonals, and are the primary tool required for solving Probability.

Connected Modern Math Modules:

CORE COMBINATION FORMULAS & LAWS
THE GOLDEN COMBINATION FORMULA
$^nC_r = \frac{n!}{r!(n - r)!}$
Selecting $r$ objects out of $n$ distinct objects where order does not matter
Permutation Link
$^nP_r = ^nC_r \times r!$

Every combination of $r$ objects can be arranged in $r!$ different ways.

Symmetry Identity
$^nC_r = ^nC_{n - r}$

Choosing $r$ objects is identical to choosing $n-r$ objects to leave out (e.g. $^{20}C_{17} = ^{20}C_3$).

Pascal's Addition
$^nC_r + ^nC_{r-1} = ^{n+1}C_r$

Fundamental binomial expansion property used in advanced series questions.

SOLVED EXAMPLES (STEP-BY-STEP)
EASY

Selecting Student Groups

Q: How many ways can 3 students be selected from a class of 5 students?

Step 1: Identify $n = 5$ total students, $r = 3$ to select.

Step 2: Apply $^nC_r = ^5C_3 = \frac{5!}{3!(5-3)!} = \frac{5!}{3! \times 2!}$.

Step 3: Calculate: $\frac{120}{6 \times 2} = \frac{120}{12} = \mathbf{10 \text{ ways}}$.

MEDIUM

Committee Formation

Q: How many committees of 4 members can be formed from 8 people?

Step 1: Here $n = 8$ people, $r = 4$ committee positions.

Step 2: Apply $^8C_4 = \frac{8!}{4!(8-4)!} = \frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1}$.

Step 3: Simplify: $\frac{1680}{24} = \mathbf{70 \text{ committees}}$.

HARD (CAT LEVEL)

Large Team Selection with Symmetry Identity

Q: A cricket team of 11 players must be selected from 15 available players. How many different teams are possible?

Step 1: Need to calculate $^{15}C_{11}$.

Step 2 (Symmetry Identity): Apply $^nC_r = ^nC_{n-r} \implies ^{15}C_{11} = ^{15}C_{15-11} = \mathbf{^{15}C_4}$.

Step 3: Calculate $^{15}C_4 = \frac{15 \times 14 \times 13 \times 12}{4 \times 3 \times 2 \times 1} = 15 \times 7 \times 13 = \mathbf{1,365 \text{ teams}}$.

COMMON TRAPS & MISTAKES TO AVOID
❌ Trap 1: Wrong Formula

Using Permutations instead of Combinations

Always ask: Does changing the order create a different outcome? If NO (e.g. forming a committee), use Combinations ($^nC_r$), not Permutations.

❌ Trap 2: Large Calculations

Forgetting $^nC_r = ^nC_{n-r}$

Don't calculate $^{20}C_{18}$ directly! Convert to $^{20}C_2 = \frac{20 \times 19}{2} = 190$ to avoid calculation mistakes.

❌ Trap 3: Ranking Mistakes

Using Combinations for Ranking

If positions such as 1st, 2nd, and 3rd place matter, order matters—use Permutations ($^nP_r$), not Combinations.

CAT & CET SPEED SHORTCUTS

⚡ The Decision Rule

ARRANGE $\implies$ PERMUTATION | SELECT $\implies$ COMBINATION

Look for key words: select, choose, form, pick, committee, team, group $\implies$ order does not matter.

⚡ Memorize Common $nC2$ & $nC3$ Values

$^5C_2 = 10$ | $^6C_2 = 15$ | $^6C_3 = 20$ | $^7C_2 = 21$ | $^8C_2 = 28$

Memorizing small combinations saves time in Probability & Geometry counting questions.

PRACTICE QUESTIONS

Question 1 (Basic):

How many ways can 2 students be selected from a class of 6 students?

Question 2 (Moderate):

From 10 students, a committee of 4 members is to be formed. One particular student MUST always be included. How many such committees can be formed?

FREQUENTLY ASKED QUESTIONS (FAQS)
Q: How do I know whether to use Permutations or Combinations?

Ask: Does changing the order create a different outcome? If YES, use Permutations ($^nP_r$). If NO, use Combinations ($^nC_r$).

Q: Why is nCr equal to nC(n-r)?

Choosing $r$ objects from $n$ available objects is mathematically identical to choosing the $n-r$ objects to leave out. Both yield the exact same count.

Q: Can I solve Probability without learning Combinations?

While basic probability can be done by direct outcome listing, almost all intermediate and advanced CAT probability problems rely heavily on combinations.

EXPLORE RELATED QUANT VAULT MODULES