| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 10:16:29 IST
|
|
|
hi plzzzzz explain how to do this question "how many 4 letter words can be formed using the letters of the word "INEFFECTIVE"? '' plzzzzzzzz i need urgent reply ruhi
|
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:03:59 IST
|
|
|
The word INEFFECTIVE has following letters E,E,E ; F,F ; I,I ; N,C,T,V So the number of 4 letter words will be the coefficient of x4 in the expression 4! ( 1 + x/1 + x2/2 + x3/6)(1 + x/1 + x2/2)2(1 + x)4 where the first term corresponds to how many times E would be taken. The x terms are divided by the factorial of the number of times they are taken because the alike letters will result in less permutations. The second term corresponds to the number of times the F and I are taken and the last term corresponds to the number of times N,C,T,V are taken. So find the coefficient of x4 to obtain the correct answer. This is a general method and can be applied to any word. Cheers
|
There is only one .. one best way !!!!!!!!! |
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:05:31 IST
|
|
|
Great work done this a absolutely correct approach !!!!!!!!!! I hope ruhi this helps u !!
|
Puneet Agrawal
IIT Delhi
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:07:32 IST
|
|
|
hi is there any oyher method to solve this question???
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:09:11 IST
|
|
|
or plz explain this method in a more simple manner
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:10:23 IST
|
|
|
Well yes there is one more method where u actually take case and see that whether we have taken all different letters or some letters are alike and so on. However the method described above is simple as u do not need to worry about the cases. The answer will automatically come. DO you understand the approach that has been used above ??
|
Puneet Agrawal
IIT Delhi
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:12:00 IST
|
|
|
sir i ve not used this method before so i could not get it. can u plz explain it 2 me????
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:16:36 IST
|
|
|
okay let me explain ... first of all do not use that word SIR .. just a kid like u ... may made it earlier to IIT thats it . ok  Now about the approach .. see the letter E can appear in a four letter word for one , two or three times.. OKay ?? Now if the letter E appears 3 times then we need to divide by factorial(3) since otherwise we are counting redundant case. So note that the x^3 has been divided by factorial(3) which is 6. Similarily for other letters. Try to understand that x^n denotes that the letter appears n times in the word. Now is it clear ???
|
Puneet Agrawal
IIT Delhi
|
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:20:58 IST
|
|
|
sorry but still not getting
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:23:06 IST
|
|
|
ok ok now i got it. thanx
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:32:16 IST
|
|
|
hehe cannot understand this ...
|
There is only one .. one best way !!!!!!!!! |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:34:07 IST
|
|
|
Ooooooops hmm how do I explain ?? hehe ... try to take a simple example let us suppose the word in LAMA and we need to make 2 letter words from that. OKAY ?? So let us see ... by using the previous approach We will find coefficeint of x2 in the expression 2! (1 + x)2(1 + x + x2/2) So we find coefficeint of x2 in ( 1 + x2 + 2.x).(1 + x + x2/2) The terms corresponding to x2 are 2! ( 1 + 2.1 + 1/2)x2 which is 7. Now see the normal way the two letter words can be AA, AL, AM, LA, LM, MA, ML which are 7 in number so the approach works okay?? The expression will change if u make 5 letter words .. in this case u will replace 4! by 5! and find coefficiet of x^5. okay ... cheers
|
Puneet Agrawal
IIT Delhi
|
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:34:07 IST
|
|
|
now i got it
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 11 Nov 2006 12:34:46 IST
|
|
|
Thank god u got it ........
|
Puneet Agrawal
IIT Delhi
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 20 Nov 2006 00:26:22 IST
|
|
|
puneet sir has used an excellent method which is actually an application of the multinomial theorem
|