The nPr formula works perfectly when every object being arranged is distinct. But real exam questions rarely stay that convenient — ask a student to rearrange the letters of ROOT, ALLAHABAD, or MISSISSIPPI, and suddenly some letters repeat. Using plain nPr here would overcount, because it treats identical letters as if they were distinguishable. This post explains exactly why that overcounting happens and how to correct for it.

Why Repeated Objects Change the Count

Take the word ROOT. It has 4 letters, but the two O’s are identical. If we temporarily label them O₁ and O₂, we get 4! = 24 permutations of 4 “distinct” symbols.

But here’s the catch: RO₁O₂T and RO₂O₁T look identical once we stop distinguishing the O’s — both are just “ROOT.” Every genuine arrangement corresponds to exactly 2! = 2 of these labelled permutations, since the two O’s can swap places without changing the visible word.

So the actual number of distinct arrangements is:

4! / 2! = 24 / 2 = 12

This single idea — divide out the internal rearrangements of each repeated group — is the entire logic behind permutations of non-distinct objects.

The General Formula

Theorem 3: The number of permutations of n objects, where p objects are of the same kind and the rest are all different, is:

n! / p!

Theorem 4 (general case): If n objects consist of p₁ objects of one kind, p₂ of a second kind, …, pₖ of a _k_th kind, and the rest are different, the number of distinct permutations is:

n! / (p₁! × p₂! × … × pₖ!)

Each repeated group contributes its own factorial in the denominator, because each group’s internal swaps don’t create a new visible arrangement.

Worked Example: ALLAHABAD

Find the number of permutations of the letters of ALLAHABAD.

ALLAHABAD has 9 letters total, with 4 A’s, 2 L’s, and the rest (H, B, D) all different.

Number of arrangements = 9! / (4! × 2!) = 362880 / (24 × 2) = 362880 / 48 = 7560

Notice how quickly the count would have been wrong using plain 9! — that would have massively overcounted by treating all four A’s and both L’s as distinguishable.

Worked Example: INSTITUTE

INSTITUTE has 9 letters, where I appears 2 times and T appears 3 times.

Number of arrangements = 9! / (2! × 3!) = 362880 / (2 × 6) = 30240

Worked Example: Coloured Discs

In how many ways can 4 red, 3 yellow, and 2 green discs be arranged in a row, if discs of the same colour are indistinguishable?

Total discs = 4 + 3 + 2 = 9, with three repeated groups.

Number of arrangements = 9! / (4! × 3! × 2!) = 362880 / (24 × 6 × 2) = 1260

This is a reminder that the formula isn’t limited to letters — it applies to any set with identical items, including coloured balls, beads, flags, and tiles.

Worked Example: INDEPENDENCE

INDEPENDENCE (12 letters: N×3, E×4, D×2, rest distinct) combines several ideas at once.

Total unrestricted arrangements: 12! / (3! × 4! × 2!) = 1,663,200

Arrangements starting with P: Fix P at the extreme left; rearrange the remaining 11 letters (still 3 N’s, 4 E’s, 2 D’s): 11! / (3! × 2! × 4!) = 138,600

Arrangements where all vowels occur together: There are 5 vowels — 4 E’s and 1 I. Bundle them as a single block. This block plus the 7 remaining letters gives 8 “objects” (with 3 N’s, 2 D’s), arranged in 8!/(3!×2!) ways. The vowels inside the block rearrange in 5!/4! ways (since the E’s repeat). Multiplying: (8!/(3!×2!)) × (5!/4!) = 3360 × 5 = 16,800

Arrangements where vowels never occur together: Do not subtract the “together” count here — that removes only the cases where all five vowels form one block, and still counts arrangements with exactly two vowels adjacent. Use the gap method: arrange the 7 consonants first, then drop the vowels into the gaps between them.

Consonants are N×3, D×2, P×1, C×1 — 7 letters in 7!/(3!×2!) = 420 arrangements. That leaves 8 gaps (before the first, between each pair, after the last). Choose 5 of those gaps for the 5 vowels and order them within their gaps (5!/4! = 5, since the E’s repeat): C(8,5) × 5 = 56 × 5 = 280.

Total = 420 × 280 = 117,600

The subtraction trick is reliable when the condition is “all together,” as in the block count above. For “never together” it undercounts the excluded set, so reach for the gap method instead.

A Quick Note on MISSISSIPPI-Type Problems

MISSISSIPPI has 11 letters: I×4, S×4, P×2, M once. A common variant asks how many arrangements have the four I’s not together. As with INDEPENDENCE, use the gap method: arrange the 7 non-I letters (S×4, P×2, M — 7!/(4!×2!) = 105 arrangements), giving 8 gaps; choose 4 for the I’s, which are identical, so C(8,4) = 70. Total = 105 × 70 = 7,350.

Common Mistakes to Avoid

  • Forgetting a repeated letter entirely — always list out letter frequencies before writing the formula.

  • Dividing by n! of the wrong group — each repeated letter gets its own factorial in the denominator; don’t combine them into one factorial by mistake.

  • Using plain nPr instead of the repeated-objects formula whenever a word has any letter appearing more than once.

  • Substituting “subtract from total” for the gap method on “never together” questions — the subtraction only removes the all-in-one-block cases, so it overcounts. Use gaps for “never adjacent”, and subtraction only for “all together”.

Get Repeated-Letter Questions Right Every Time

Repeated letters trip up more answers than any other permutation variant, because the divisor depends on getting the letter counts exactly right. ChampionsPrep offers CBSE Class 11 Maths practice on repeated-objects permutations, with instant feedback on the division step. It is free to register and you pay only as you use — start at app.championsprep.in .

Permutations of Repeated Letters: Arranging Words Like MISSISSIPPI podcast artwork
Audio LessonClass 11

Permutations of Repeated Letters: Arranging Words Like MISSISSIPPI

ChampionsPrep MathematicsEpisode 1474:50

Subscribe in any podcast app:

Frequently Asked Questions

Why do we divide by factorials when letters repeat? +

Because identical letters can be internally rearranged without creating a visibly new word. Dividing by the factorial of each repeated group removes this overcounting.

What is the formula for permutations of a word with repeated letters? +

If a word of n letters has groups of p1, p2, and so on repeated letters, with the rest distinct, the number of distinct arrangements is n! divided by the product of the factorials of each repeated group size.

How do you find arrangements where certain letters must stay together? +

Treat the letters that must stay together as a single combined block. Arrange this block along with the remaining letters, then multiply by the number of internal arrangements within the block.

How do you find arrangements where letters must never be together? +

Use the gap method: arrange the other letters first, then place the restricted letters into the gaps between them, so no two land side by side. Subtracting the 'all together' count does not work for three or more restricted letters — it still counts the arrangements where only two are adjacent.

Does this formula work for objects other than letters? +

Yes. It applies to any set of items containing identical members, such as coloured discs, beads, digits, or symbols, not just alphabet letters in a word.