Answer:
(A) -8
Step-by-step explanation:
∆=b^2 -4ac= (-4)^2-4(2)(3)= -8
Since discriminant<0, then the equation has no roots.
Answer:
the answer is 8
Step-by-step explanation:
1/2(8 + 4) = 6
0.5(8 + 4) = 6
(4 + 2) = 6
6 = 6
The first and only stop of the flight can be Boise, Omaha or Chicago. This means there are 3 possibilities where to stop. From thee the flight connects to New York City, either to La Guardia or to JFK Airport.
1 possible route: Seattle-Boise-La Guardia
<span>2 possible route: Seattle-Omaha-La Guardia
</span><span>3 possible route: Seattle-Chicago-La Guardia
</span><span>4 possible route: Seattle-Boise-NYC
</span><span>5 possible route: Seattle-Omaha-NYC
</span><span>6 possible route: Seattle-Chicago-NYC
</span>
Or in other words: There are two airports where the flight can arrive and for each of them there are three possible routes. So, in total there are 2*3=6 possible routes.
Answer:
27
Step-by-step explanation:
know that
h = 3
h × h × h
3 × 3 × 3
= 27
Answer:
(7 X 3) x 6 = 7 x (3 X 6)
Step-by-step explanation:
