Show worked solution
Worked solution
Recognise the configuration.
You are given two sides and an angle that is NOT between them. This is the one configuration that may not pin the triangle down, so the number of triangles has to be tested.
Work out the height from C down to the line AB.
Put at one end of a line and swing side up at to reach . The shortest distance from back down to that line is cm.
Compare the swinging side with that height.
Side starts at and swings down to meet the line. If it is shorter than it never gets there; if it is longer it crosses. Here is shorter than .
Compare the swinging side with the fixed side.
If is at least as long as , only one of the two crossings lies on the correct side of , and there is one triangle. If is shorter than but longer than , both crossings are valid.
Apply the three-way test for the ambiguous case.
Here , so the swinging side is too short to reach the base line at all and no triangle exists.
Say what the two triangles would be, if there are two.
When two triangles exist they share the same , and , and differ only in angle : one takes the acute inverse sine, the other its obtuse partner .
Ask whether an obtuse angle would also work.
A sine value never picks out one angle on its own: and are equal. Whenever the sine rule is used to find an ANGLE you must decide whether the obtuse partner is possible too.
Check the answer against the picture.
The figure shows the arc of radius cm drawn from : it meets the base line in the number of places the test predicts, so the count is .
Check the labelling convention.
In triangle the side is opposite angle , side is opposite angle and side is opposite angle . Getting this pairing right is what makes both rules work.
Check the calculator is in degree mode.
Every angle here is in degrees. Test the calculator with : it must give . In radian mode it gives and every answer would be wrong.
Note the borderline case.
If were exactly equal to the swinging side would just touch the line, giving a single right-angled triangle. That is the knife edge between two triangles and none.
Note why the other options are impossible.
A circle can cut a straight line in at most two points, so SSA can never give three triangles, and the given lengths fix the shape, so it can never give infinitely many.
Note the rule you would use next.
Whichever count comes out, the way to find angle is the sine rule, and the count tells you how many of the two inverse sines to keep.
Note that SSS, SAS and AAS never behave like this.
Three sides, or two sides with the angle between them, or two angles with a side, all fix the triangle completely. Only SSA — two sides and an angle NOT between them — can leave a choice.
State how many triangles are possible.
Here , so the swinging side is too short to reach the base line at all and no triangle exists.