The Gateway to Computer Science Excellence
0 votes

Choose 4 letters from the word ' ARSUN SURESH '  ?

My Approach

H--1       11 letter word .

case 1 : All 4 letters are different 

case2 : 2 letters same 2 letters different

case 3 : 2 letters same , 2 letters same

case 4 : 3 letters same , 1 letter different

case 5 : all 4 letters are same

There are 7 distinct letters and we have to choose 4 from them C(7,4)


2R's and any 2 distinct OR    C(2,2)* C(7,2) +     

2S's and any 2 distinct OR     C(3,2)* C(7,2) +   // Choose two S from three

2U's and any 2 distinct         C(2,2)* C(7,2)

2R's and 2'S      C(2,2)* C(3,2) +

2S's and 2U's    C(2,2)* C(3,2) +

2U's and 2 R's   C(2,2)* C(3,2)

There are no enough letters .  Therefore req no of ways for case4 is 0

in Combinatory by Boss (21.5k points)
retagged by | 182 views

2 Answers

+1 vote
This problem can also be solved using generating functions as:

We are interested in 4 word letters, so if we represent all possibilities for occurrence of alphabets of given string using exponential generating function as:

$A = \frac{z^{0}}{0!} + \frac{z^{1}}{1!}$

$R = \frac{z^{0}}{0!} + \frac{z^{1}}{1!} + \frac{z^{2}}{2!}$

$S = \frac{z^{0}}{0!} + \frac{z^{1}}{1!} + \frac{z^{2}}{2!} + \frac{z^{3}}{3!}$

$U = \frac{z^{0}}{0!} + \frac{z^{1}}{1!} + \frac{z^{2}}{2!}$

$N = \frac{z^{0}}{0!} + \frac{z^{1}}{1!}$

$E = \frac{z^{0}}{0!} + \frac{z^{1}}{1!}$

$H = \frac{z^{0}}{0!} + \frac{z^{1}}{1!}$

Considering the product of these generating functions, $h(z)$:
$h(z) = A*R*S*U*N*E*H$

We need to extract coefficient of $z^{4}$ to get the solution. However, this way it becomes quite time consuming and error-prone to solve.
by Active (1.8k points)
I dont know anything about generating functions . I feel it is the most difficult part to understand . Your answer seems to be not useful for me . Could you please help me with my approach and guide me what is wrong in that ?  Thanks. :)
0 votes

I apologize for interpreting the question incorrectly. Your question asks for number of 4 alphabet selections from given set of 2 words and not the number of words of length 4. So here is my take, 

Case 0: 0 repetition


Case 1: 1 repetition of length 2:


Case 2: 2 repetitions of length 2:


Case 3: 1 repetition of length 3:


On your solution :

In case 2... Once say 2 R's are selected.... You have 6 distinct alphabets to select from...  so IMO $\binom{7}{2}$ is incorrect. 

In case far as I understand your reasoning.... $\binom{3}{2}$ is incorrect since  S's are indistinguishable from each other so there is only one way to select 1/2/3 S's from a set of repetitions of S. 

by Active (1.8k points)
edited by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
104,906 users