Answer:
-10
Step-by-step explanation:
divide both sides by -4
simplify to v+8=-2
subtract 8 from both sides
v=-10
Answer:
34,220
Step-by-step explanation:
Because order doesn't matter, but the numbers can't be repeated, we need to find the number of combinations where 3 individual numbers can be chosen out of 60 possible numbers using the binomial coefficient:

Thus, Elias can make 34,220 unique 3-number codes given 60 different numbers.
Answer:
x = 15
Step-by-step explanation:
This involves the Secant and Segments Theorem.
8(19 + 8) = 9(9 + x)
216 = 81 + 9x
9x = 135
x = 15
Answer:
<h3>$ 20 </h3>
Step-by-step explanation:

<em>hope</em><em> </em><em>this</em><em> </em><em>helps</em><em> </em><em>you</em><em>.</em>
<em>Can</em><em> </em><em>I</em><em> </em><em>have</em><em> </em><em>the</em><em> </em><em>brainliest</em><em> </em><em>please</em><em>?</em>
<em>Have</em><em> </em><em>a</em><em> </em><em>nice</em><em> </em><em>day</em><em>!</em>
Answer:
answer is 2
Step-by-step explanation:
if you create an equation: (s+4)x2 = boris s-1x12 = opa
only one that only works out is 2