Once you’re comfortable with the fundamental principle of counting , the next step in CBSE Class 11 Maths Chapter 6 is turning that repeated multiplication into a compact formula. That’s exactly what factorial notation and the permutation formula, nPr, do. This post walks through both concepts the way NCERT builds them — starting from filling vacant places, and ending at a single clean equation you can apply to almost any arrangement problem.

What Is a Permutation?

Definition: A permutation is an arrangement, in a definite order, of a number of objects taken some or all at a time.

The key word here is order. If you rearrange the letters R, O, S, E into ROSE, OSER, or SORE, each is a different permutation because the sequence matters. This is what separates permutations from combinations, where order doesn’t matter — a distinction we’ll return to later in this series.

Deriving the Permutation Formula (Theorem 1)

Consider n distinct objects, from which you want to arrange r of them in order (where 0 < r ≤ n). Think of it as filling r vacant places using the multiplication principle:

  • The 1st place can be filled in n ways.

  • The 2nd place can be filled in (n − 1) ways (one object is already used).

  • The 3rd place can be filled in (n − 2) ways.

  • …continuing until the _r_th place, filled in (n − (r − 1)) ways.

By the multiplication principle, the total number of arrangements is:

n(n − 1)(n − 2) … (n − r + 1)

This expression is called nPr — “the number of permutations of n different objects taken r at a time.” It’s correct, but it’s cumbersome to write repeatedly, which is exactly why factorial notation exists.

Factorial Notation Explained

The symbol n! (“n factorial”) represents the product of the first n natural numbers:

n! = 1 × 2 × 3 × … × (n − 1) × n

A few reference values worth memorising:

  • 1! = 1

  • 2! = 2

  • 3! = 6

  • 4! = 24

  • 5! = 120

  • 0! = 1 (defined this way, not derived — remember this, it trips up a lot of students)

A useful recursive identity: n! = n × (n − 1)!, which also means n! = n(n − 1)(n − 2)!, and so on. This recursive structure is exactly what makes the nPr derivation work cleanly.

Worked Example: Evaluating Factorials

Evaluate 7! − 5!.

  • 7! = 1 × 2 × 3 × 4 × 5 × 6 × 7 = 5040

  • 5! = 120

  • 7! − 5! = 5040 − 120 = 4920

A common trap: students sometimes compute (7 − 5)! instead, which gives 2! = 2 — a completely different (and wrong) answer. Factorial does not distribute over subtraction, so always evaluate each factorial separately before combining.

The Formula for nPr

By multiplying the numerator and denominator of n(n − 1)(n − 2)…(n − r + 1) by (n − r)!, NCERT derives the much cleaner form:

nPr = n! / (n − r)!, where 0 ≤ r ≤ n

This is the formula you’ll use in almost every permutation problem from here on. Two special cases are worth knowing:

  • When r = n: nPn = n!/0! = n! (arranging all n objects uses the full factorial).

  • When r = 0: nP0 = n!/n! = 1 (there’s exactly one way to arrange nothing — leave everything as is).

Worked Examples Using nPr

Example: 3-Letter Words from NUMBER

How many 3-letter words (with or without meaning) can be formed from the letters of NUMBER, without repeating any letter?

NUMBER has 6 distinct letters, and we’re arranging 3 of them in order:

6P3 = 6!/3! = 6 × 5 × 4 = 120

Example: Chairman and Vice-Chairman

From a group of 12 persons, in how many ways can a Chairman and a Vice-Chairman be chosen, assuming no one can hold both positions?

This is a permutation problem because the two roles are distinct — choosing person A as Chairman and B as Vice-Chairman is different from the reverse.

12P2 = 12!/10! = 12 × 11 = 132 ways

Permutations With Repetition Allowed

So far we’ve assumed no object repeats. But what if repetition is allowed — for example, forming a 4-digit code from digits 0–9 where digits can repeat?

Theorem 2: The number of permutations of n different objects taken r at a time, where repetition is allowed, is simply n^r.

Revisiting the ROSE example: if repetition were allowed while forming 4-letter words from ROSE’s 4 distinct letters, the count would be 4⁴ = 256, compared to just 4P4 = 4! = 24 without repetition. This contrast is a favourite exam question precisely because it tests whether you understand why the two formulas differ, not just that they do.

Lock In the Permutation Formula With Practice

Factorials and nPr are the foundation for every later counting question, so fluency here pays off across the whole chapter. ChampionsPrep offers CBSE Class 11 Maths practice on permutations, factorials and repetition cases, with step-by-step feedback. It is free to register and you pay only as you use — start at app.championsprep.in .

Factorial Notation and Permutations: Understanding the nPr Formula podcast artwork
Audio LessonClass 11

Factorial Notation and Permutations: Understanding the nPr Formula

ChampionsPrep MathematicsEpisode 1444:46

Subscribe in any podcast app:

Frequently Asked Questions

What is the formula for nPr? +

nPr = n! / (n − r)!, where 0 ≤ r ≤ n. It gives the number of ways to arrange r objects out of n distinct objects, where order matters.

Why is 0! defined as 1? +

It's a mathematical convention that keeps formulas like nPr = n!/(n − r)! consistent even when r = n, since nPn = n!/0! must equal n!. It isn't derived from the product definition — it's defined this way for the formulas to work correctly.

What is the difference between n! and nPr? +

n! is the number of ways to arrange all n objects. nPr is the number of ways to arrange only r objects chosen out of n. When r = n, nPr becomes equal to n!.

Does nPr allow repetition of objects? +

No. The standard nPr formula assumes objects do not repeat. When repetition is allowed, the count instead becomes n raised to the power r, a separate formula.

How is factorial notation useful outside permutations? +

Factorials appear throughout combinatorics, probability, binomial expansions, and even calculus, making this notation essential well beyond Chapter 6 of CBSE Class 11 Maths.