If n fair six-sided dice are tossed and the numbers showing on top are recorded, how many (a) record sequences are possible? (b) sequence contain exactly one six? (c) sequences contain exactly four twos, assuming n >= 4
The Answer to the Question
is below this banner.
Here's the Solution to this Question
(a) For each cube there are 6 possible outcomes. Then for n cubes there will be possible sequences
(b) We have exactly one six in n tosses. Since number six can occur anywhere in the sequence(but exactly once), there is n such places( 6 on the first place, on the second, ... , on the nth place). On each of the others (n-1) places can occur any number except of 6. So, there are totally such sequences
(c) sequences contain exactly four twos, assuming n ⩾ 4. There is places where twos can be placed. On the others (n-4) places can occur anything except of 2. So, there is possible sequences for any of the places where 2 occured. Totally we got sequences