Answer:
3676.44 rad/min
Step-by-step explanation:
It is a problem about the angular speed of the car's wheel.
You can calculate the angular speed by using the following formula, which relates the tangential speed of the wheels (the same as the speed of the car) with the angular speed:
( 1 )
v: speed of the car = tangential speed of the wheels = 47mph
r: radius of the wheels = 27/2 in = 13.5 in
you change the units of the speed:

next, you replace the values of v and r in the equation (1):

Then, the car's tires are turning with an angular speed of 3676.44 rad/min
Answer:
m=1/3
Step-by-step explanation:
11m- 4/3=2m+5/3
-2m. - 2m
9m -4/3=5/3
+4/3.+ 4/3
9m= 9/3
m=1/3
Y = x² - 4x + 4
y = 2x - 4
Find intersection of L and C:
x² - 4x + 4 = 2x - 4
x² - 6x + 8 = 0
<span> (x - 2)(x - 4) = 0
x = 2 or x = 4
When x = 2 , y = 2(2) - 4 = 0
When x = 4, y = 2(4) - 4 = 4
Points of intersection = A(2, 0) and B(4, 4)
Find the length of AB:
</span>

<span>
Answer: 4.47 units</span>
Answer:
a) ![P[C]=p^n](https://tex.z-dn.net/?f=P%5BC%5D%3Dp%5En)
b) ![P[M]=p^{8n}(9-8p^n)](https://tex.z-dn.net/?f=P%5BM%5D%3Dp%5E%7B8n%7D%289-8p%5En%29)
c) n=62
d) n=138
Step-by-step explanation:
Note: "Each chip contains n transistors"
a) A chip needs all n transistor working to function correctly. If p is the probability that a transistor is working ok, then:
![P[C]=p^n](https://tex.z-dn.net/?f=P%5BC%5D%3Dp%5En)
b) The memory module works with when even one of the chips is defective. It means it works either if 8 chips or 9 chips are ok. The probability of the chips failing is independent of each other.
We can calculate this as a binomial distribution problem, with n=9 and k≥8:
![P[M]=P[C_9]+P[C_8]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)\\\\P[M]=p^{8n}(p^{n}+9(1-p^n))\\\\P[M]=p^{8n}(9-8p^n)](https://tex.z-dn.net/?f=P%5BM%5D%3DP%5BC_9%5D%2BP%5BC_8%5D%5C%5C%5C%5CP%5BM%5D%3D%5Cbinom%7B9%7D%7B9%7DP%5BC%5D%5E9%281-P%5BC%5D%29%5E0%2B%5Cbinom%7B9%7D%7B8%7DP%5BC%5D%5E8%281-P%5BC%5D%29%5E1%5C%5C%5C%5CP%5BM%5D%3DP%5BC%5D%5E9%2B9P%5BC%5D%5E8%281-P%5BC%5D%29%5C%5C%5C%5CP%5BM%5D%3Dp%5E%7B9n%7D%2B9p%5E%7B8n%7D%281-p%5En%29%5C%5C%5C%5CP%5BM%5D%3Dp%5E%7B8n%7D%28p%5E%7Bn%7D%2B9%281-p%5En%29%29%5C%5C%5C%5CP%5BM%5D%3Dp%5E%7B8n%7D%289-8p%5En%29)
c)
![P[M]=(0.999)^{8n}(9-8(0.999)^n)=0.9](https://tex.z-dn.net/?f=P%5BM%5D%3D%280.999%29%5E%7B8n%7D%289-8%280.999%29%5En%29%3D0.9)
This equation was solved graphically and the result is that the maximum number of chips to have a reliability of the memory module equal or bigger than 0.9 is 62 transistors per chip. See picture attached.
d) If the memoty module tolerates 2 defective chips:
![P[M]=P[C_9]+P[C_8]+P[C_7]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1+\binom{9}{7}P[C]^7(1-P[C])^2\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])+36P[C]^7(1-P[C])^2\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)+36p^{7n}(1-p^n)^2](https://tex.z-dn.net/?f=P%5BM%5D%3DP%5BC_9%5D%2BP%5BC_8%5D%2BP%5BC_7%5D%5C%5C%5C%5CP%5BM%5D%3D%5Cbinom%7B9%7D%7B9%7DP%5BC%5D%5E9%281-P%5BC%5D%29%5E0%2B%5Cbinom%7B9%7D%7B8%7DP%5BC%5D%5E8%281-P%5BC%5D%29%5E1%2B%5Cbinom%7B9%7D%7B7%7DP%5BC%5D%5E7%281-P%5BC%5D%29%5E2%5C%5C%5C%5CP%5BM%5D%3DP%5BC%5D%5E9%2B9P%5BC%5D%5E8%281-P%5BC%5D%29%2B36P%5BC%5D%5E7%281-P%5BC%5D%29%5E2%5C%5C%5C%5CP%5BM%5D%3Dp%5E%7B9n%7D%2B9p%5E%7B8n%7D%281-p%5En%29%2B36p%5E%7B7n%7D%281-p%5En%29%5E2)
We again calculate numerically and graphically and determine that the maximum number of transistor per chip in this conditions is n=138. See graph attached.
53.35/11 = 4.85 for 1 key chain
4.85 *4 = 19.40