Q.Find the number of
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →ACCOUNTANCY's 11 letters reduce to 7 distinct letters with repetitions A(2), C(3), N(2), O(1), U(1), T(1), Y(1); counting 4-letter combinations by repetition pattern gives 89 combinations and 1,422 permutations.
With repeated letters, split combinations by pattern: all-different uses (k = number of distinct letters); "2 alike + 2 different" and similar patterns use combinations of the repeat-eligible letters. Each combination's permutations ; total permutations .
- ACCOUNTANCY A,C,C,O,U,N,T,A,N,C,Y — 11 letters; counting repeats: A, C, N, and O, U, T, Y each once. So there are 7 distinct letters, and letters with copies are .
Combinations of 4 letters (by pattern)
2. All 4 different: choose 4 of the 7 distinct letters: .
3. 2 alike + 2 different: choose the repeated letter from : 3 ways; choose 2 different letters from the other 6 distinct letters: ; combinations .
4. 2 alike + 2 alike (two different pairs): choose 2 letters from : . …
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.