If Bryan wants to make $2000 dollars then he needs to solve this equation:
2000=500+150x
-500 -500
1500=150x divide by 150 on both sides
x=10
10 cars
If you multiply or divide by a positive number the inequality sign DOES NOT CHANGE!
If you multiply or divide by a negative number the inequality sign flips around and becomes the opposite.
Step-by-step explanation:
<h2>
<em><u>You can solve this using the binomial probability formula.</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows:</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: </u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) </u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) n=4, x=2, k=2</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) n=4, x=2, k=2when x=2 (4 2)(1/6)^2(5/6)^4-2 = 0.1157</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) n=4, x=2, k=2when x=2 (4 2)(1/6)^2(5/6)^4-2 = 0.1157when x=3 (4 3)(1/6)^3(5/6)^4-3 = 0.0154</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) n=4, x=2, k=2when x=2 (4 2)(1/6)^2(5/6)^4-2 = 0.1157when x=3 (4 3)(1/6)^3(5/6)^4-3 = 0.0154when x=4 (4 4)(1/6)^4(5/6)^4-4 = 0.0008</u></em></h2><h2>
<em><u>You can solve this using the binomial probability formula.The fact that "obtaining at least two 6s" requires you to include cases where you would get three and four 6s as well.Then, we can set the equation as follows: P(X≥x) = ∑(k=x to n) C(n k) p^k q^(n-k) n=4, x=2, k=2when x=2 (4 2)(1/6)^2(5/6)^4-2 = 0.1157when x=3 (4 3)(1/6)^3(5/6)^4-3 = 0.0154when x=4 (4 4)(1/6)^4(5/6)^4-4 = 0.0008Add them up, and you should get 0.1319 or 13.2% (rounded to the nearest tenth)</u></em></h2>
Answer:
I disagree with the other answer.
Step-by-step explanation:
The reason for this is because if you have 12/32 for team 1, and 15/35 on team 2, then you do cross products(a type of shortcut).
12/32 15/35
1) Multiply 12 and 35= 420
2) Multiply 15 and 32= 480
3) Which number is greater?
<u>Answer</u>
<em>TEAM 2</em>..(or the visiting team)
Answer: E) 1/5
Step-by-step explanation:
The probability of any member being selected for each of the 3 posts is 1/10 that is they have equal probabilities of being selected for any of the posts.
The probability that harry would be selected for;
Secretary Ps= 1/10
Treasurer Pt = 1/10
So the probability of being selected for either secretary or treasurer is
P = Ps + Pt
P = 1/10 + 1/10
P = 2/10
P = 1/5
Note: ignore the sequence of selection
