# Difference between revisions of "Law of Sines"

CaptainFlint (talk | contribs) (→Advanced) |
(→Introductory) |
||

Line 49: | Line 49: | ||

<center><math> | <center><math> | ||

− | \mathrm{(A) \ } | + | \mathrm{(A) \ } |

\qquad \mathrm{(B) \ } 8/\sqrt{15} | \qquad \mathrm{(B) \ } 8/\sqrt{15} | ||

\qquad \mathrm{(C) \ } 5/2 | \qquad \mathrm{(C) \ } 5/2 | ||

Line 57: | Line 57: | ||

([[University of South Carolina High School Math Contest/1993 Exam/Problem 29|Source]]) | ([[University of South Carolina High School Math Contest/1993 Exam/Problem 29|Source]]) | ||

+ | |||

===Intermediate=== | ===Intermediate=== | ||

*[[Triangle]] <math>ABC</math> has sides <math>\overline{AB}</math>, <math>\overline{BC}</math>, and <math>\overline{CA}</math> of [[length]] 43, 13, and 48, respectively. Let <math>\omega</math> be the [[circle]] [[circumscribe]]d around <math>\triangle ABC</math> and let <math>D</math> be the [[intersection]] of <math>\omega</math> and the [[perpendicular bisector]] of <math>\overline{AC}</math> that is not on the same side of <math>\overline{AC}</math> as <math>B</math>. The length of <math>\overline{AD}</math> can be expressed as <math>m\sqrt{n}</math>, where <math>m</math> and <math>n</math> are [[positive integer]]s and <math>n</math> is not [[divisibility | divisible]] by the [[square]] of any [[prime]]. Find the greatest [[integer]] less than or equal to <math>m + \sqrt{n}</math>. | *[[Triangle]] <math>ABC</math> has sides <math>\overline{AB}</math>, <math>\overline{BC}</math>, and <math>\overline{CA}</math> of [[length]] 43, 13, and 48, respectively. Let <math>\omega</math> be the [[circle]] [[circumscribe]]d around <math>\triangle ABC</math> and let <math>D</math> be the [[intersection]] of <math>\omega</math> and the [[perpendicular bisector]] of <math>\overline{AC}</math> that is not on the same side of <math>\overline{AC}</math> as <math>B</math>. The length of <math>\overline{AD}</math> can be expressed as <math>m\sqrt{n}</math>, where <math>m</math> and <math>n</math> are [[positive integer]]s and <math>n</math> is not [[divisibility | divisible]] by the [[square]] of any [[prime]]. Find the greatest [[integer]] less than or equal to <math>m + \sqrt{n}</math>. |

## Revision as of 21:16, 3 July 2016

The **Law of Sines** is a useful identity in a triangle, which, along with the law of cosines and the law of tangents can be used to determine sides and angles. The law of sines can also be used to determine the circumradius, another useful function.

## Contents

## Theorem

In triangle , where is the side opposite to , opposite to , opposite to , and where is the circumradius:

## Proof

### Method 1

In the diagram above, point is the circumcenter of . Point is on such that is perpendicular to . Since , and . But making . We can use simple trigonometry in right triangle to find that

The same holds for and , thus establishing the identity.

### Method 2

This method only works to prove the regular (and not extended) Law of Sines.

The formula for the area of a triangle is .

Since it doesn't matter which sides are chosen as , , and , the following equality holds:

Assuming the triangle in question is nondegenerate, . Multiplying the equation by yields:

## Problems

### Introductory

- If the sides of a triangle have lengths 2, 3, and 4, what is the radius of the circle circumscribing the triangle?

(Source)

### Intermediate

- Triangle has sides , , and of length 43, 13, and 48, respectively. Let be the circle circumscribed around and let be the intersection of and the perpendicular bisector of that is not on the same side of as . The length of can be expressed as , where and are positive integers and is not divisible by the square of any prime. Find the greatest integer less than or equal to .

(Source)

### Advanced

Let be a convex quadrilateral with , , and let be the intersection point of its diagonals. Prove that if and only if .

(Source)