-3,1-6,5,0 i think that’s it
Answer: use PEMDAS
Step-by-step explanation:
There are C(5,2) = 10 ways to choose 2 contraband shipments from the 5. There are C(11, 1) = 11 ways to choose a non-contraband shipment from the 11 that are not contraband. Hence there are 10*11 = 110 ways to choose 3 shipments that have 2 contraband shipments among them.
There are C(16,3) = 560 ways to choose 3 shipments from 16. The probability that 2 of those 3 will contain contraband is
110/560 = 11/56 ≈ 19.6%
_____
C(n,k) = n!/(k!(n-k)!)
Answer:
hey i was wondering if I can be made a the answer is the L 0ne
sorry if im wrong
Answer:
28
Step-by-step explanation:
25+26+27+28=106
