Difference between revisions of "1981 USAMO Problems"
(→Problem 2) |
|||
| Line 30: | Line 30: | ||
== See Also == | == See Also == | ||
{{USAMO box|year=1981|before=[[1980 USAMO]]|after=[[1982 USAMO]]}} | {{USAMO box|year=1981|before=[[1980 USAMO]]|after=[[1982 USAMO]]}} | ||
| + | {{MAA Notice}} | ||
Revision as of 18:11, 3 July 2013
Problems from the 1981 USAMO.
Problem 1
Prove that if 
is not a multiple of 
, then the angle 
can be trisected with ruler and compasses.
Problem 2
What is the largest number of towns that can meet the following criteria. Each pair is directly linked by just one of air, bus or train. At least one pair is linked by air, at least one pair by bus and at least one pair by train. No town has an air link, a bus link and a train link. No three towns, 
are such that the links between 
and 
are all air, all bus or all train.
Problem 3
Show that for any triangle, 
.
When does the equality hold?
Problem 4
A convex polygon has sides. Each vertex is joined to a point 
not in the same plane. If are adjacent vertices of the polygon take the angle between the planes 
and 
. The sum of the such angles equals the sum of the angles in the polygon. Show that 
.
Problem 5
Show that for any positive real 
, ![$[nx]\ge \sum_{1}^{n}\left(\frac{[kx]}{k}\right)$](http://latex.artofproblemsolving.com/8/9/0/890ce23466abfd1bcb2eb253ac571925c0362163.png)
See Also
| 1981 USAMO (Problems • Resources) | ||
| Preceded by 1980 USAMO |
Followed by 1982 USAMO | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
