1989 USAMO Problems: Difference between revisions
No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
Problems from the '''1989 [[USAMO]].''' | |||
==Problem 1== | ==Problem 1== | ||
For each positive integer <math>n</math>, let | For each positive integer <math>n</math>, let | ||
Latest revision as of 17:52, 18 July 2016
Problems from the 1989 USAMO.
Problem 1
For each positive integer
, let
.
Find, with proof, integers
such that
and
.
Problem 2
The 20 members of a local tennis club have scheduled exactly 14 two-person games among themselves, with each member playing in at least one game. Prove that within this schedule there must be a set of 6 games with 12 distinct players.
Problem 3
Let
be a polynomial in the complex variable
, with real coefficients
. Suppose that
. Prove that there exist real numbers
and
such that
and
.
Problem 4
Let
be an acute-angled triangle whose side lengths satisfy the inequalities
. If point
is the center of the inscribed circle of triangle
and point
is the center of the circumscribed circle, prove that line
intersects segments
and
.
Problem 5
Let
and
be real numbers such that
Determine, with proof, which of the two numbers,
or
, is larger.
See Also
| 1989 USAMO (Problems • Resources) | ||
| Preceded by 1988 USAMO |
Followed by 1990 USAMO | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America.