Will give brainliest! How many distinct triangles can be made? I think I have to first find the measure of length b and then com
pare measure a with b and h to find the answer. Please help me out on how to find measure length b
1 answer:
Check the picture below.
this is a case of the ambiguous case with an SSA, AC and CB are the sides and the angle is at A.
the ambiguous case has two triangles, the case when B is acute, CB sticks out, and the case when B is obtuse, CB sticks inside, it just so happen that those two angles for B are "supplementary" angles.
if you check the sin⁻¹ of that, we'll get the acute version of B, that's because of the constraints on the range of the inverse sine function, and we get ∡B ≈ 36.86989765°.
and of course, the other angle for B will be 180 - 36.86989765.
this is a case of the ambiguous case with an SSA, AC and CB are the sides and the angle is at A.
the ambiguous case has two triangles, the case when B is acute, CB sticks out, and the case when B is obtuse, CB sticks inside, it just so happen that those two angles for B are "supplementary" angles.
if you check the sin⁻¹ of that, we'll get the acute version of B, that's because of the constraints on the range of the inverse sine function, and we get ∡B ≈ 36.86989765°.
and of course, the other angle for B will be 180 - 36.86989765.
You might be interested in
Answer:
Here's what I get
Step-by-step explanation:
The formula for a quadratic equation is
ax² + bx + c = 0
The quadratic formula gives the roots:
D is the discriminant.
It tells us the number of roots to the equation — the number of times the graph crosses the x-axis.
It doesn't matter if the graph opens upwards or downwards.
If D > 0, the graph crosses the x-axis at two points.
If D = 0, the graph touches the x-axis at one point.
If D < 0, the graph never reaches the x-axis.
Your graph must look like one of the two graphs on the right in the Figure below.
