If we divide both sides by -2, we have

So, if you choose b=3, you have x = -3/3=-1
D Would be the correct answer.
CommentBy similar triangles it can be shown that AD^2 = AB*AC
If you want the proof, Google tangents and secants of a circle.
FindSo we want
AB
GivensAD = 16
BC = 9
AB = ??
CA = CB + AB
CA = 9 + AB
FormulaAB * (AB + BC) = AD^2
Sub and SolveAB*(AB + 9) = 16^2
AB*(AB + 9) = 256 Remove the brackets.
AB^2 + 9AB = 256 Subtract 256 from both sides.
AB^2 + 9AB - 256 = 0
You can only do this either with a graph or the quadratic formula. I'll get the graph for you. You can made these yourself at Desmos.
x = [-b +/- sqrt(b^2 - 4ac)] / (2a)
a = 1
b = 9
c = -256
AnswerWhen you substitute these into the quadratic formula, you get
x1 = 12.12 and
x2 = -21.12
x2 is meaningless. The solution is
x = 12.12
CommentBut that's not your question. Your question is what is this rounded to the nearest 1/10th? That's a fancy way of saying round to the first decimal place. Since the hundredth place (or second place) is 2, 12.12 rounds to 12.1
The answer is
x = 12.1 <<<<< answer.
All you’re doing is subtracting $15.35 from $20.00. After you get the answer, add $1.25 as many times as possible before it exceeds the number you got from the first subtraction.
$20.00 - 15.35 = $4.65
$1.25 x 3 = $3.75
(Anything over $3.75 would require additional money, so you couldn’t buy any more chocolate bunnies than 3.)
You could buy 3 chocolate bunnies after purchasing 1 dozen tulips for $15.35 with the remaining $4.65 you have left.
I struggle with math myself, so I’d recommend working it out on your own instead of pasting online answers because it pays off in the end! <3
Answer:
336 ways ;
56 ways
Step-by-step explanation:
Number of ways to have the officers :
Number of qualified candidates, n = 8
Number of officer positions to be filled = 3
A.)
Using permutation (since the ordering matters):
nPr = n! ÷(n-r)!
8P3 = 8! ÷ (8-3)!
8P3 = 8! ÷ 5!
8P3 = (8*7*6)
8P3 = 336 ways
B.) Different ways of appointing committee: (ordering doesn't count as officers can also be appointed)
Using the combination relation :
nPr = n! ÷(n-r)!r!
8C3 = 8! ÷ (8-3)! 3!
8C3 = 8! ÷ 5!3!
8C3 = (8*7*6) ÷ (3*2*1)
8C3 = 336 / 6
8C3 = 56 ways