Answer:
The second option is the correct answer
The sequence is : 0, -1, -6, -31, -156
Step-by-step explanation:
It is given that,
The recursive formula , an = 5a(n-1) - 1 and a1 = 0
<u>To find a2, a3, a4, a5
</u>
a2 = 5a1 -1 = 5x0 - 1 = -1
a3 = 5a2 - 1 = (5x -1 ) - 1 = - 5 - 1 = -6
a4 = 5a3 - 1 =(5x -6) - 1 = -30 - 1= -31
a5 = 5a4 - 1 = (5 x -31 ) - 1 = -155 -1 = -156
Therefore the resulting sequence is
0, -1, -6, -31 ,-156
Answer:
thus the probability that a part was received from supplier Z , given that is defective is 5/6 (83.33%)
Step-by-step explanation:
denoting A= a piece is defective , Bi = a piece is defective from the i-th supplier and Ci= choosing a piece from the the i-th supplier
then
P(A)= ∑ P(Bi)*P(C) with i from 1 to 3
P(A)= ∑ 5/100 * 24/100 + 10/100 * 36/100 + 6/100 * 40/100 = 9/125
from the theorem of Bayes
P(Cz/A)= P(Cz∩A)/P(A)
where
P(Cz/A) = probability of choosing a piece from Z , given that a defective part was obtained
P(Cz∩A)= probability of choosing a piece from Z that is defective = P(Bz) = 6/100
therefore
P(Cz/A)= P(Cz∩A)/P(A) = P(Bz)/P(A)= 6/100/(9/125) = 5/6 (83.33%)
thus the probability that a part was received from supplier Z , given that is defective is 5/6 (83.33%)
1.2 minutes per hours is the correct answer
