An ordinary cubical dice having six faces marked with alphabets A,B,C,D,E, and F is thrown 15 times and the list of 15 alphabets showing up are noted. Find the number of ways in which among the alphabets A,B,C,D,E, and F only three of them appear in the list.
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.
Total ways to choose 3 alphabets { x , y , z } from { A , B , C , D , E , F } = ( 3 6 )
For a given triplet { x , y , z } ,
Total ways to arrange alphabets from { x , y , z } in the list = 3 1 5
Total ways to arrange 2 alphabets from { x , y , z } in the list = 3 × 2 1 5
Total ways to arrange 1 alphabet from { x , y , z } in the list = 3 × 1 1 5
Hence, total ways to arrange alphabets from { x , y , z } in the list
such that each of the alphabet appears at least once = 3 1 5 − 3 × 2 1 5 + 3 × 1 1 5
Hence, total required ways = ( 3 6 ) × ( 3 1 5 − 3 × 2 1 5 + 3 × 1 1 5 ) = 2 8 5 0 1 2 1 2 0