I’ll give brainliest if someone can explain that answer
2 answers:
You might be interested in
Answer:
8 different combinations are possible.
Step-by-step explanation:
Here, we have 2 different combinations for each time.
And the player comes out to bat 3 times.
So, total number of combinations are:
i.e. a total of 8 number of times.
Let a hit is termed as 'H' and an out is termed as 'O'.
Total combinations are:
{HHH, HHO, HOH, HOO, OHH, OHO, OOH, OOO}
Kindly have a look at the tree diagram attached in the answer area.
In starting, there are 2 combinations possible, i.e. 'O' and 'H'.
After 'O' , 2 possible i.e. 'O' and 'H'.
After 'H' , 2 possible i.e. 'O' and 'H'.
and so on....
Answer:
140 weeks.
Step-by-step explanation:
We are being asked for the maximum number that can elapse without having 2 subcommitees with the same members and the same chair. Notice that the secretary is not mentioned in this statement, so we can ignore that position.
Now, the maximum number of weeks would be equal to the total possible combinations of subcommitees that can be formed from the 7 individuals commiteed, times the number of options that can sit at the chair possition.
The total possible combinations of subcommitees that can be formed from the 7 individuals can be expressed like the following expression. Notice that there is no a particular order to be considered, so we use the combination formula:
=
= 35
Now, each of the 4 individuals have the same probability of being chosen as the chair commitee. So, we have to multiply 4 times the number of possible subcommitees in order to arrive our answer:
x = 35 * 4 = 140
This would be the maximum number of subcommitees that can be formed with no subcommitees with the same members and the same chair occurring.