Answer:
Step-by-step explanation:
You have to use the discriminant for this. If the quadratic is
, then
a = -4, b = -3, and c = 7. The formula for finding the discriminant is
which comes from the quadratic formula, but without the square root sign. Filling in:
which simplifies down to
D = 9 + 112 so
D = 121. This is a perfect square, so the solutions will be 2 real. Just so you know, you will NEVER have a solution like the one offered in the third choice down. If you have one imaginary root, you will ALWAYS have a second by the conjugate rule.
Answer:
1.5
Step-by-step explanation:
Answer:
A A A B B B C C C
Step-by-step explanation:
We have the Greedy algorithm, the solution at any time is considered an optimal algorithm.
In our case the sequence is x x x y y y z z z
In addition to the Greedy algorithm, the first advertiser chooses their choice without considering the minimum methods.
Now we must consider the worst case of greedy algorithm so we must suppose that it starts from advertiser C, then B and followed by A.
Therefore the worst option would come being:
C C C B B B, in addition that A cannot bid for any query.
Which means that the sequence of the balanced algorithm will be A A A B B B C C C
Answer:
<u>D) The two angles are complementary</u>
Step-by-step explanation:

Answer:
Object will be at a distance of 358098.6 km from the source
Step-by-step explanation:
We have given angle = 0.0008 degree 
Radius is given = 2.50 km
Linear size of the object will be equal to diameter
So linear size = 2.5×2 = 5 km
We know that linear size 
So 
d = 358098.6 km