Answer:
Step-by-step explanation:
a). Mean of the given data set = 
= 28
b). x

32 32-28 = 4 16
28 28 - 28 = 0 0
18 18 - 28 = -10 100
40 40 - 28 = 12 144
22 22 - 28 = -6 36
= 296
c). Standard deviation = 
= 
= 7.69
d). Mean of the new set of weights = 
= 34
Since mean of the data set is more close to each data, standard deviation will be less than the deviation given in part (c).
Answer: There are
ways of doing this
Hi!
To solve this problem we can think in term of binary numbers. Let's start with an example:
n=5, A = {1, 2 ,3}, B = {4,5}
We can think of A as 11100, number 1 meaning "this element is in A" and number 0 meaning "this element is not in A"
And we can think of B as 00011.
Thinking like this, the empty set is 00000, and [n] =11111 (this is the case A=empty set, B=[n])
This representation is a 5 digit binary number. There are
of these numbers. Each one of this is a possible selection of A and B. But there are repetitions: 11100 is the same selection as 00011. So we have to divide by two. The total number of ways of selecting A and B is the
.
This can be easily generalized to n bits.
First option: About the same
Second option: Greater for conference A than B
Hope it helps!
Answer:
answer = 12 min
Step-by-step explanation:
40% of 30 min = ?
10% of 30 min = 3
3*4 = 12
Thus, she spends 12 min of her 30 min lunch driving
P.S.
If the answer is wrong, then multiply it by two and retry