Answer:
Probability =0.9898
Step-by-step explanation:
Given that, mean = 4 = 300 standard deviation = 70 n = 100 PT = H = 128 oT = 0 / V n = 70/ v 100 = 7 a) within 6 = 300 ±6 = 294, 306 P(294< ī < 306) = P[(294 - 300) 7 < (ĩ -H ï) / o ĩ < (306 300) /7)] = P(-0.86 < Z < 0.86) = P(Z < 0.86) - P(Z < -0.86) Using z table, 0.8051 - 0.1949 %3D %3D %3D = 0.6102 Probability = 0.6102 a) within 18 = 300 t 18 = 294, 318 P(294< ī < 306) = P[(282 - 300) / 7< (ã -H i) / oī< (318 - 300) /7)] = P(-2.57 < Z< 2.57) = P(Z < 2.57) - P(Z < -2.57) Using z table, =0.9949 - 0.0051 =0.9898 Probability =0.9898
Answer:
Step-by-step explanation:
F(x) = 7 - 5x + 7x²
f(-9) = 7 - 5*(-9) + 7*(-9)²
= 7 + 45 + 7*81
= 7 + 45 + 567
= 619
Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
yez they can but it depend on wat type of triangle
