Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1987 AIME Problems

Revision as of 00:14, 11 February 2007 by Minsoens (talk | contribs)

Problem 1

An ordered pair $\displaystyle (m,n)$ of non-negative integers is called "simple" if the addition $\displaystyle m+n$ in base $\displaystyle 10$ requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to $\displaystyle 1492$.

Solution

Problem 2

What is the largest possible distance between two points, one on the sphere of radius 19 with center $\displaystyle (-2,-10,-5)$ and the other on the sphere of radius 87 with center $\displaystyle (12,8,-16)$?

Solution

Problem 3

By a proper divisior of a natural number we mean a positive integral divisor other than 1 and the number itself. A natural number greater than 1 will be called "nice" if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers?

Solution

Problem 4

Find the area of the region enclosed by the graph of $\displaystyle |x-60|+|y|=|x/4|.$

Solution

Problem 5

Find $\displaystyle 3x^2 y^2$ if $\displaystyle x$ and $\displaystyle y$ are integers such that $\displaystyle y^2 + 3x^2 y^2 = 30x^2 + 517$.

Solution

Problem 6

Rectangle $\displaystyle ABCD$ is divided into four parts of equal area by five segments as shown in the figure, where $\displaystyle XY = YB + BC + CZ = ZW = WD + DA + AX$, and $\displaystyle PQ$ is parallel to $\displaystyle AB$. Find the length of $\displaystyle AB$ (in cm) if $\displaystyle BC = 19$ cm and $\displaystyle PQ = 87$ cm.

AIME 1987 Problem 6.png

Solution

Problem 7

Let $\displaystyle [r,s]$ denote the least common multiple of positive integers $\displaystyle r$ and $\displaystyle s$. Find the number of ordered triples $\displaystyle (a,b,c)$ of positive integers for which $\displaystyle [a,b] = 1000$, $\displaystyle [b,c] = 2000$, and $\displaystyle [c,a] = 2000$.

Solution

Problem 8

What is the largest positive integer $\displaystyle n$ for which there is a unique integer $\displaystyle k$ such that $\displaystyle \frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}$?

Solution

Problem 9

Triangle $\displaystyle ABC$ has right angle at $\displaystyle B$, and contains a point $\displaystyle P$ for which $\displaystyle PA = 10$, $\displaystyle PB = 6$, and $\displaystyle \angle APB = \angle BPC = \angle CPA$. Find $\displaystyle PC$.

AIME 1987 Problem 9.png

Solution

Problem 10

Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, Bob, walks up to the top of the escalator and counts 75 steps. If Al's speed of walking (in steps per unit time) is three times Bob's walking speed, how many steps are visible on the escalator at a given time? (Assume that this value is constant.)

Solution

Problem 11

Find the largest possible value of $\displaystyle k$ for which $\displaystyle 3^{11}$ is expressible as the sum of $\displaystyle k$ consecutive positive integers.

Solution

Problem 12

Let $\displaystyle m$ be the smallest integer whose cube root is of the form $\displaystyle n+r$, where $\displaystyle n$ is a positive integer and $\displaystyle r$ is a positive real number less than $\displaystyle 1/1000$. Find $\displaystyle n$.

Solution

Problem 13

A given sequence $\displaystyle r_1, r_2, \dots, r_n$ of distinct real numbers can be put in ascending order by means of one or more "bubble passes". A bubble pass through a given sequence consists of comparing the second term with the first term, and exchanging them if and only if the second term is smaller, then comparing the third term with the second term and exchanging them if and only if the third term is smaller, and so on in order, through comparing the last term, $\displaystyle r_n$, with its current predecessor and exchanging them if and only if the last term is smaller.

The example below shows how the sequence 1, 9, 8, 7 is transformed into the sequence 1, 8, 7, 9 by one bubble pass. The numbers compared at each step are underlined.

$\underline{1 \quad 9} \quad 8 \quad 7$
$1 \quad {}\underline{9 \quad 8} \quad 7$
$1 \quad 8 \quad \underline{9 \quad 7}$
$1 \quad 8 \quad 7 \quad 9$

Suppose that $\displaystyle n = 40$, and that the terms of the initial sequence $\displaystyle r_1, r_2, \dots, r_{40}$ are distinct from one another and are in random order. Let $\displaystyle p/q$, in lowest terms, be the probability that the number that begins as $\displaystyle r_{20}$ will end up, after one bubble pass, in the $\displaystyle 30^{\mbox{th}}$ place. Find $\displaystyle p + q$.

Solution

Problem 14

Compute

$\frac{(10^4+324)(22^4+324)(34^4+324)(46^4+324)(58^4+324)}{(4^4+324)(16^4+324)(28^4+324)(40^4+324)(52^4+324)}$

.

Solution

Problem 15

Squares $\displaystyle S_1$ and $\displaystyle S_2$ are inscribed in right triangle $\displaystyle ABC$, as shown in the figures below. Find $\displaystyle AC + CB$ if area $\displaystyle (S_1) = 441$ and area $\displaystyle (S_2) = 440$.

AIME 1987 Problem 15.png

Solution

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1987_AIME_Problems&oldid=13069"