Five distinct alphabets are to be transmitted through a communication channel. A total number of 15 blanks is to be inserted between the two letters with at least three between every two. Find the number of ways in which this can be done.
Try out other JEE problems!
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.
Excellent explanation Sir! I appreciate your solution
Log in to reply
Thanks! Nice problem. Your generating function approach is great too. :)
For 1 ⩽ i ⩽ 4 , let x i ( ⩾ 3 ) , be the number of blanks between the ith and the (i+1)th lettter. Then
x 1 + x 2 + x 3 + x 4 = 1 5 ⋯ E q . 1
The Number Of Solutions of Eq. 1-
= coefficient of t 1 5 in ( t 3 + t 4 + ⋯ )
= coefficient of t 3 in ( 1 − t ) − 4
= coefficient of t 3 in ( 1 + 1 4 C + 2 5 C t 2 + 3 6 C t 3 ⋯ )
= 3 6 C
= 2 0
But the 5 letters can be permuted in 5 ! = 1 2 0 ways.
Thus the required number of arrangements = 1 2 0 . 2 0
2 4 0 0
Problem Loading...
Note Loading...
Set Loading...
First, however we distribute the blanks, there will be 5 ! = 1 2 0 ways to order the 5 distinct letters.
Next, let a n be the number of blanks between the n th and ( n + 1 ) st letters for 1 ≤ n ≤ 4 . We then require that a 1 + a 2 + a 3 + a 4 = 1 5 such that a n ≥ 3 for each n .
The number of solutions to this equation will be the same as the number of ways of arranging the blanks as required. Now let a n ′ = a n − 3 for each n . Our equation the becomes
a 1 ′ + a 2 ′ + a 3 ′ + a 4 ′ = 1 5 − 4 ∗ 3 = 3 , such that a n ′ ≥ 0 for each n .
This is now a stars and bars calculation, and thus has ( 3 3 + 4 − 1 ) = ( 3 6 ) = 2 0 solutions.
Thus the number of ways of arranging the letters and blanks as specified is 1 2 0 ∗ 2 0 = 2 4 0 0 .