Matilda, Tanya and Renee are auditioning for a play. In how many ways can the girls fill the roles of a grandmother, mother, and
2 answers:
Answer: 1) In 6 ways the girls can fill the roles of a grandmother, mother, and daughter.
2) A permutation would be used to solve this problem
Step-by-step explanation:
Permutation is an arrangement of the elements of a list into a one to one correspondence with itself, where as a combination is a collection of things in which order doesn't matter at all.
In the given situation there are three girls named Matilda, Tanya and Renee are auditioning for a play. The girls have to fill the roles of a grandmother, mother, and daughter that means no girl can take two roles or no two girls can 1 role i.e. repetition is not allowed so by permutation ,
the number of ways the girls can fill the roles=,where n is the total roles and r is the number of girls.
Therefore, in 6 ways the girls can fill the roles of a grandmother, mother, and daughter.
You might be interested in
Answer:
P[(X=n+k)] ∩ X>n)] =P[X=K]
Step-by-step explanation:
If X is a geometric random variable then
for success probability = p
so for failure q= 1-p
Now as given
Now for the P parameter we have
x∈{1,2,3,....∞}
P[(X=n+k)] ∩ X>n)] = P(X=n+K)
P[(X=n+k)] ∩ X>n)] =
P[(X=n+k)] ∩ X>n)] =
P[(X=n+k)] ∩ X>n)] =P[X=K]