Number of A’s Number of B’s Number of C’s Number of D’s Number of E’s Number of F’s Number of G’s Number of H’s Number of I’s = = = = = = = = = 6 6 6 5 5 4 4 3 3
Find the number of 5 lettered words which you can make from the above given set of letters .
Details And Assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice one. but will look good with latex.
the beauty of the problem is to think of inclusion exclusion as the number of letters available to us are nearby to 5 only.so unfavourable cases will be quite less . otherwise as in the other part of the problem using inclusion exclusion will create a mess.
Log in to reply
true.i would advise all to try part 2 too.that is more interesting.
Using the exponential generating function:
G ( x ) = ( 1 + x + 2 ! x 2 + 3 ! x 3 + 4 ! x 4 + 5 ! x 5 + 6 ! x 6 ) 3 ( 1 + x + 2 ! x 2 + 3 ! x 3 + 4 ! x 4 + 5 ! x 5 ) 2 ( 1 + x + 2 ! x 2 + 3 ! x 3 + 4 ! x 4 ) 2 ( 1 + x + 2 ! x 2 + 3 ! x 3 ) 2
the solution is [ 5 ! x 5 ] G ( x ) = 8 3 9 3 1 × 5 ! = 5 8 9 6 5
Problem Loading...
Note Loading...
Set Loading...
by principle of inclusion exclusion every letter of the five letter word can be chosen in 9 ways total no. of ways=9^5 but we would have to exclude the cases where there are 4 or more H or I's and 5 or more F or G's. total no. of such cases=(2x8x5!/4!)+4=84 therefore answer=9^5-84 =58965