Mathematics · JKSSB Accounts Assistant (Finance) — November 2026 · Last updated:
View the full solved paper: JKSSB Accounts Assistant (Finance) — November 2026
In how many different ways can the letters of the word "SMART" be arranged such that all the letters are used without repetition?
- A. 24
- B. 60
- C. 120 (Correct answer)
- D. 720
Correct Answer
Option C — 120
Detailed Solution & Explanation
In Permutations and Combinations, the number of distinct linear arrangements of $n$ different objects taken all $n$ at a time without repetition is given by:
$^nP_n = n! = n \times (n - 1) \times (n - 2) \times \dots \times 2 \times 1$
- The word "SMART" consists of $n = 5$ all-distinct letters (`S`, `M`, `A`, `R`, `T`), with 5 choices for the first position, 4 for the second, 3 for the third, 2 for the fourth, and 1 for the last.
- Total number of arrangements: $5! = 5 \times 4 \times 3 \times 2 \times 1 = \mathbf{120}$ (Option C).
Topics covered: Permutations, Combinations & Binomial Theorem