To find the number of non-defective chips, we simply use this equation:
2,000 * 4/5
8000/5
Now you simply divide:
1600
1600 chips aren't defective
Answer:
= n - 2
Step-by-step explanation:
Note the difference between consecutive terms is constant, that is
0 - (- 1) = 0 + 1 = 1
1 - 0 = 1
2 - 1 = 1
3 - 2 = 1
This indicates the sequence is arithmetic with n th term
= a₁ + (n - 1)d
where a₁ is the first term and d the common difference
Here a₁ = - 1 and d = 1, thus
= - 1 + n - 1 = n - 2
Answer:
m < −4/3
Step-by-step explanation:
−5(3m−2)>30
Simplify both sides of the inequality.
−15m+10>30
Subtract 10 from both sides.
−15m+10−10>30−10
−15m>20
Divide both sides by -15.
−15m/−15 > 20/−15
m<−4/3
You would take 1818÷33=55.09
55.09 is how many toothpicks it took for each step made
Then you would take 55.09×55=3029.95
You can make sure this is correct by taking 55.09×33=1817.97 which would actually be 1818 because you had to round it up
Answer:
1/20
Step-by-step explanation:
The probability of any of the friends sitting on any of the seats is equal.
So the probability of Hamad sitting on the first seat = 1/5
As Hamad is sat on the first seat, there are now 4 available seats, so the probability of Riyadh sitting on the second seat = 1/4
Therefore, probability of Hamad sitting on the first seat AND Riyadh sitting on the second seat = 1/5 x 1/4 = 1/20
