Core Logic
First, analyze the frequency of letters in PQRPQRSTUVP.
P: 3$P: 3$
Q: 2$Q: 2$
R: 2$R: 2$
S: 1$S: 1$
T: 1$T: 1$
U: 1$U: 1$
V: 1$V: 1$
Total types of distinct letters = 7$7$ (P, Q, R, S, T, U, V).
We need to form 4-letter words. We break this down into mutually exclusive cases based on letter duplication.
Step 1: Case 1 - 3 Alike, 1 Different
Only 'P' can be chosen for the 3 alike letters. (1$1$ way: ¹C₁${^1C_1}$)
The 1 different letter can be chosen from the remaining 6$6$ distinct letters. (⁶C₁${^6C_1}$)
Arrangements = (4!)/(3!) = 4$\frac{4!}{3!} = 4$
Number of words = 1 × 6 × 4 = 24$1 \times 6 \times 4 = 24$
Step 2: Case 2 - 2 Alike, 2 Alike
We need to choose 2$2$ sets of letters that each appear at least twice. Letters eligible: P, Q, R (3 options).
Choose 2 sets: ³C₂ = 3${^3C_2} = 3$
Arrangements = (4!)/(2!2!) = 6$\frac{4!}{2!2!} = 6$
Number of words = 3 × 6 = 18$3 \times 6 = 18$
Step 3: Case 3 - 2 Alike, 2 Different
Choose 1 set of letters to be alike from {P, Q, R}: ³C₁ = 3${^3C_1} = 3$
Choose 2 distinct letters from the remaining 6$6$ types: ⁶C₂ = 15${^6C_2} = 15$
Arrangements = (4!)/(2!) = 12$\frac{4!}{2!} = 12$
Number of words = 3 × 15 × 12 = 540$3 \times 15 \times 12 = 540$
Step 4: Case 4 - All 4 Different
Choose 4 distinct letters from the 7$7$ available types: ⁷C₄ = 35${^7C_4} = 35$
Arrangements = 4! = 24$4! = 24$
Number of words = 35 × 24 = 840$35 \times 24 = 840$
Step 5: Final Summation
Total words = Sum of all cases = 24 + 18 + 540 + 840 = 1422$24 + 18 + 540 + 840 = 1422$
Pattern Recognition
Letter grouping requires strict combinatorial partition cases (AAAB, AABB, AABC, ABCD). Never mix selection (ⁿCᵣ$^nC_r$) with arrangement (factorials) in the same unwritten step—do them rigorously sequentially.
Chapter Mix
Class 11 Maths: Permutations and Combinations