Answer:
a) 0.0184
b) 0.1829
Step-by-step explanation:
a) With geometric distribution you can measure the number of trials until the first success, that is, a defective chip is found, as follows:
P(x = k) = p*(1-p)^(k-1)
This means: probability to find exactly 1 defective in k trials, p is the probability to find a defective chip, which is equal to 0.02, and the number of trials are k = 5. Replacing:
P(x = 5) = 0.02*(1-0.02)^(5-1) = 0.0184
b) If you want the probability of 1 success within k trials, compute:

Replacing with k = 10

Answer:
![2x^2y[x^{2}y^{2}-6xy-4]](https://tex.z-dn.net/?f=2x%5E2y%5Bx%5E%7B2%7Dy%5E%7B2%7D-6xy-4%5D)
Step-by-step explanation:
we have

Factor 
so
![2x^2y[x^{2}y^{2}-6xy-4]](https://tex.z-dn.net/?f=2x%5E2y%5Bx%5E%7B2%7Dy%5E%7B2%7D-6xy-4%5D)
Answer:
*followed*
Step-by-step explanation:
Answer:
x-intercepts/ roots= (-1,0), (15,0)
f(0)= -15 (y-intercept)
Axis of symmetry: x = 7
Vertex: (7, -64)
Domain: All real numbers
Range: [-64, infty)