Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
Step-by-step explanation:
Answer:
a. Chi-square test of independence
Step-by-step explanation:
The chi square statistics is also used to test the hypothesis about the independence of two variables each of which is classified into a number of categories or attributes.
In the given problem the Equal , more or less are the attributes.
The goodness of fit test is applicable when the cell probabilities depend upon the unknown parameters provided that the unknown parameters are replaced with their estimates and provided that one degree of freedom is deducted for each parameter estimated.
Answer:
<h2>100f = 27.272727...</h2>
Step-by-step explanation:
f = 0.272727...
100f = (100)(0.272727...)
100f = 27.272727...
Answer:
38.5
Step-by-step explanation:
First do 77/2 then you get 38.5, if anything is wrong please tell me!!
