Faces of a dice

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.

Do like and share.


The answer is 285012120.

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.

1 solution

Pawan Kumar
Apr 15, 2015

Total ways to choose 3 3 alphabets { x , y , z } \{x, y, z\} from { A , B , C , D , E , F } \{A, B, C, D, E, F\} = = ( 6 3 ) 6 \choose 3

For a given triplet { x , y , z } \{x, y, z\} ,

Total ways to arrange alphabets from { x , y , z } \{x, y, z\} in the list = 3 15 = 3^{15}

Total ways to arrange 2 2 alphabets from { x , y , z } \{x, y, z\} in the list = 3 × 2 15 = 3 \times 2^{15}

Total ways to arrange 1 1 alphabet from { x , y , z } \{x, y, z\} in the list = 3 × 1 15 = 3 \times 1^{15}

Hence, total ways to arrange alphabets from { x , y , z } \{x, y, z\} in the list

such that each of the alphabet appears at least once = 3 15 3 × 2 15 + 3 × 1 15 = 3^{15} - 3 \times 2^{15} + 3 \times 1^{15}

Hence, total required ways = = ( 6 3 ) 6 \choose 3 × ( 3 15 3 × 2 15 + 3 × 1 15 ) = 285012120 \times (3^{15} - 3 \times 2^{15} + 3 \times 1^{15}) = 285012120

Exactly the same method!

Adarsh Kumar - 6 years, 2 months ago

Why no of ways to arrange 1 alphabet is added not subtracted?

Le Solver - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...