What is the recursive formula for this sequence . 10,14,18,22,26
2 answers:
You might be interested in
Answer:
P(X ≥ 1) = 0.50
Step-by-step explanation:
Given that:
The word "supercalifragilisticexpialidocious" has 34 letters in which 'i' appears 7 times in the word.
Then; the probability of success = 7/34 = 0.20588
Using Binomial distribution to determine the probability; we have:
where;
x = 0,1,2,...n and 0 < β < 1
and x represents the number of successes.
However; since the letter is drawn thrice; the probability that the letter "i" is drawn at least once can be computed as:
P(X ≥ 1) = 1 - P(X< 1)
P(X ≥ 1) = 1 - P(X =0)
P(X ≥ 1) = 1 - 0.50
P(X ≥ 1) = 0.50
Answer:
P(at least 1 dull blade)=0.7068
Step-by-step explanation:
I hope this helps.
This is what it's called dependent event probability, with the added condition that at least 1 out of 5 blades picked is dull, because from your selection of 5, you only need one defective to decide on replacing all.
So if you look at this from another perspective, you have only one event that makes it so you don't change the blades: that 5 out 5 blades picked are sharp. You also know that the probability of changing the blades plus the probability of not changing them is equal to 100%, because that involves all the events possible.
P(at least 1 dull blade out of 5)+Probability(no dull blades out of 5)=1
P(at least 1 dull blade)=1-P(no dull blades)
But the event of picking one blade is dependent of the previous picking, meaning there is no chance of picking the same blade twice.
So you have 38/48 on getting a sharp one on your first pick, then 37/47 (since you remove 1 sharp from the possibilities, and 1 from the whole lot), and so on.
Also since are consecutive events, you need to multiply the events.
The probability that the assembly is replaced the first day is:
P(at least 1 dull blade)=1-P(no dull blades)
P(at least 1 dull blade)=0.7068
To find x, refer to the attachment
