1987 USAMO Problems

Revision as of 18:42, 18 July 2016 by 1=2 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problems from the 1987 USAMO.

Problem 1

Find all solutions to $(m^2+n)(m + n^2)= (m - n)^3$, where m and n are non-zero integers.

Solution

Problem 2

The feet of the angle bisectors of $\Delta ABC$ form a right-angled triangle. If the right-angle is at $X$, where $AX$ is the bisector of $\angle A$, find all possible values for $\angle A$.

Solution

Problem 3

$X$ is the smallest set of polynomials $p(x)$ such that:

1. $p(x) = x$ belongs to $X$.
2. If $r(x)$ belongs to $X$, then $x\cdot r(x)$ and $(x + (1 - x) \cdot r(x) )$ both belong to $X$.

Show that if $r(x)$ and $s(x)$ are distinct elements of $X$, then $r(x) \neq s(x)$ for any $0 < x < 1$.

Solution

Problem 4

M is the midpoint of XY. The points P and Q lie on a line through Y on opposite sides of Y, such that $|XQ| = 2|MP|$ and $\frac{|XY|}2 < |MP| < \frac{3|XY|}2$. For what value of $\frac{|PY|}{|QY|}$ is $|PQ|$ a minimum?

Solution

Problem 5

$a_1, a_2, \cdots, a_n$ is a sequence of 0's and 1's. T is the number of triples $(a_i, a_j, a_k)$ with $i<j<k$ which are not equal to (0, 1, 0) or (1, 0, 1). For $1\le i\le n$, $f(i)$ is the number of $j<i$ with $a_j = a_i$ plus the number of $j>i$ with $a_j\neq a_i$. Show that $T=\sum_{i=1}^n f(i)\cdot\left(\frac{f(i)-1}2\right)$. If n is odd, what is the smallest value of T?

Solution

See Also

1987 USAMO (ProblemsResources)
Preceded by
1986 USAMO
Followed by
1988 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. AMC logo.png

Invalid username
Login to AoPS