Darshit Sir Institute

Mathematics, Class 11 and 12 · Gujarat Board, CBSE, GUJCET and JEE

Permutations, Combinations and Binomial Theorem formulas

These two chapters share one skill: deciding whether order matters. Once that is settled the formulas are short, and the binomial theorem then rests on the same combination symbol.

17 formulas, 4 memory hooks, and the 5 mistakes that cost the most marks.

Counting

WhatFormulaSymbols and notes
Fundamental principleif one task has m ways and the next has n, together they have mnmultiply along, add between alternatives
PermutationsnPr = n!/(n − r)!order matters, as in arranging
CombinationsnCr = n!/(r!(n − r)!)order does not matter, as in selecting
RelationnPr = nCr × r!arrange after selecting
SymmetrynCr = nC(n−r)choosing r to keep is choosing n − r to leave
Pascal's rulenCr + nC(r−1) = (n+1)Crthe rule that builds Pascal's triangle

Standard arrangements

WhatFormulaSymbols and notes
Circular permutations(n − 1)!one position is fixed to remove rotations
Necklace or garland(n − 1)!/2a flip gives the same arrangement
With repeated itemsn!/(p! q! r!)p, q, r are the counts of each repeated item
Repetition allowednrr places, n choices each time
At least onetotal − nonealmost always faster than counting cases

Binomial theorem

WhatFormulaSymbols and notes
Expansion(a + b)n = Σ nCr an−r brn + 1 terms in all
General termTr+1 = nCr an−r brnote the r + 1, which trips most students
Middle term, n eventhe (n/2 + 1)th termone middle term
Middle term, n oddthe (n+1)/2 th and (n+3)/2 th termstwo middle terms
Sum of coefficientsput a = b = 1, giving 2na one-line trick
Greatest coefficientthe middle term'sfor a symmetric expansion
Darshit Bhatt

Taught by Darshit Bhatt, founder and lead faculty at Darshit Sir Institute. Instrumentation and Control engineer, with a master's degree and a chartered degree, teaching in Paldi, Ahmedabad since 2006.

Know the formula but not when to use it? Darshit Sir has taught this in Paldi since 2006, in the classroom and live online.

Memory hooks

How to remember this chapter.

“Order matters, P; order does not, C”

Choosing between the two

A password is a permutation because order changes it. A committee is a combination because it does not. Ask that one question first, every time.

“Circle loses one”

Circular arrangements

Around a table there is no first seat, so fix one person and arrange the rest: (n − 1)!. A garland halves it again because it can be flipped over.

“r plus one”

The general term of a binomial expansion

Tr+1 uses r, so the fourth term needs r = 3. Half the mistakes in this chapter are an off-by-one here.

“At least one means all minus none”

Counting problems

Counting the unwanted case and subtracting is nearly always shorter than counting the wanted ones.

Where marks go

The mistakes that cost the most.

  • Using permutations for a selection where order does not matter, which inflates the answer by r!.
  • Forgetting to divide by the factorials of repeated letters when arranging a word.
  • Using n! for a circular arrangement instead of (n − 1)!.
  • Taking r as the term number in the binomial general term. The (r + 1)th term uses r.
  • Missing that an odd power gives two middle terms, not one.

Ask DSI

Stuck on this chapter?

Tell us the chapter and your class. We will tell you honestly whether our batch helps.

Talk to the teacher, not a counsellor.

Bring the student's last two report cards. You will get an honest read on where they stand and which batch actually helps, from the person who will do the teaching.

Get directions to the Ahmedabad centre