Introduction
When all letters (or items) are distinct, arranging them is straightforward - every order is unique. This pattern appears in word arrangement, ordering objects, or listing distinct items.
It is important because many exam questions ask for permutations of distinct objects; recognizing that all items are different lets you use the factorial rule directly.
Pattern: All Letters Different (Word Arrangement)
Pattern
The key idea: if you have n distinct letters and you arrange all of them, the number of arrangements is n!
Formula:
Total arrangements = n!
Why this works: For the first position there are n choices, for the second n-1, continuing until 1 → multiply them: n × (n - 1) × ... × 1 = n!.
Step-by-Step Example
Question
How many distinct arrangements (anagrams) can be made from the letters of the word PLANT?
Solution
-
Step 1: Identify what is given.
The word PLANT has n = 5 letters and all letters are distinct. -
Step 2: Choose the formula.
Usen! = 5!because all items are different and we arrange all of them. -
Step 3: Compute.
5! = 5 × 4 × 3 × 2 × 1 = 120 -
Final Answer:
There are 120 distinct arrangements of the letters of PLANT. -
Quick Check:
Pick positions: 1st = 5 choices, 2nd = 4 choices, 3rd = 3, 4th = 2, 5th = 1 → multiply = 120 ✅
Quick Variations
1. Partial arrangement: If you arrange only r of the n distinct letters, use nPr = n! / (n - r)!.
2. Distinct positions: If positions have labels (e.g., seat numbers), treat them as ordered and use factorial/permutation rules.
3. Mixed types: If some letters repeat, switch to the repeated-letters formula (divide by factorials of repeats).
Trick to Always Use
- Step 1 → Check: are all items distinct? If YES → use
n!. - Step 2 → For arranging all items, compute n! directly; for arranging only some, use nPr (multiply top r factors).
Summary
Summary
Key takeaways:
- If all n letters are different and you arrange all of them, total arrangements = n!.
- Compute factorial by multiplying descending integers (n × (n - 1) × ... × 1).
- For partial arrangements or repeated items, use the appropriate permutation or repeated-letter formulas instead.
