Exercise 6.2 · Q1
Q.Find the number of 4 letter words, with or without meaning, which can be formed using the letters of the word HONEST, when the repetition of the letters is not allowed.
Sikkim CbseNCERTSubjective· 2mImportance★★★★★est
13% · 17/126 Questions
✓ Free question
Count the 4-letter arrangements (with or without meaning) possible from the 6 distinct letters of the word HONEST, with no letter repeated.
When arranging positions using distinct items chosen from available distinct items, with no repetition, and where the order matters (a "word" is a specific sequence of letters), we use permutations:
- Identify the letters of HONEST: H, O, N, E, S, T — that is distinct letters (no letter repeats in the word itself).
- We must form 4-letter words, so positions need to be filled, each with a different one of the 6 letters (no repetition allowed).
- Since each distinct arrangement of 4 letters counts as a different "word" (order matters — HONE ≠ NOHE), apply the permutation formula: .
- Compute and .
- .
Self-check (direct multiplication-principle count): Fill the 4 positions left to right without repetition: 1st letter — 6 choices; 2nd letter — 5 remaining choices; 3rd letter — 4 remaining choices; 4th letter — 3 remaining choices. Total . ✓ Matches the permutation-formula result.
✓Final answer
four-letter words
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.