The forward differences for this data is 1, 1, 1, 1, 1, 1 (since 10 - 9 = 1, 11 - 10 = 1, etc). Since we only need one iteration of differences, a linear polynomial will fit the data exactly.
Answer:
it is C.
Step-by-step explanation:
trust me, i dont have time to expln how, it jst is
Answer:
80
Step-by-step explanation:
The median of the group is 80
If you add all the five numbers up they equal 454 divide by 5 the answer would be 90.8
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
