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

Difference between revisions of "1987 AIME Problems"

(→‎Problem 2)
m (→‎Problem 12)
 
(10 intermediate revisions by 9 users not shown)
Line 1: Line 1:
 +
{{AIME Problems|year=1987}}
 +
 
== Problem 1 ==
 
== Problem 1 ==
−
An ordered pair <math>\displaystyle (m,n)</math> of non-negative integers is called "simple" if the addition <math>\displaystyle m+n</math> in base <math>\displaystyle 10</math> requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to <math>\displaystyle 1492</math>.  
+
An ordered pair <math>(m,n)</math> of non-negative integers is called "simple" if the addition <math>m+n</math> in base <math>10</math> requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to <math>1492</math>.  
  
 
[[1987 AIME Problems/Problem 1|Solution]]
 
[[1987 AIME Problems/Problem 1|Solution]]
  
 
== Problem 2 ==
 
== Problem 2 ==
−
What is the largest possible distance between two points, one on the sphere of radius 19 with center <math>\displaystyle (-2,-10,5),</math> and the other on the sphere of radius 87 with center <math>\displaystyle (12,8,-16)</math>?
+
What is the largest possible distance between two points, one on the sphere of radius 19 with center <math>(-2,-10,5),</math> and the other on the sphere of radius 87 with center <math>(12,8,-16)</math>?
  
 
[[1987 AIME Problems/Problem 2|Solution]]
 
[[1987 AIME Problems/Problem 2|Solution]]
  
 
== Problem 3 ==
 
== 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?
+
By a proper divisor 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?
  
 
[[1987 AIME Problems/Problem 3|Solution]]
 
[[1987 AIME Problems/Problem 3|Solution]]
  
 
== Problem 4 ==
 
== Problem 4 ==
−
Find the area of the region enclosed by the graph of <math>\displaystyle |x-60|+|y|=|x/4|.</math>
+
Find the area of the region enclosed by the graph of <math>|x-60|+|y|=\left|\frac{x}{4}\right|.</math>
  
 
[[1987 AIME Problems/Problem 4|Solution]]
 
[[1987 AIME Problems/Problem 4|Solution]]
  
 
== Problem 5 ==
 
== Problem 5 ==
−
Find <math>\displaystyle 3x^2 y^2</math> if <math>\displaystyle x</math> and <math>\displaystyle y</math> are integers such that <math>\displaystyle y^2 + 3x^2 y^2 = 30x^2 + 517</math>.
+
Find <math>3x^2 y^2</math> if <math>x</math> and <math>y</math> are integers such that <math>y^2 + 3x^2 y^2 = 30x^2 + 517</math>.
  
 
[[1987 AIME Problems/Problem 5|Solution]]
 
[[1987 AIME Problems/Problem 5|Solution]]
  
 
== Problem 6 ==
 
== Problem 6 ==
−
Rectangle <math>\displaystyle ABCD</math> is divided into four parts of equal area by five segments as shown in the figure, where <math>\displaystyle XY = YB + BC + CZ = ZW = WD + DA + AX</math>, and <math>\displaystyle PQ</math> is parallel to <math>\displaystyle AB</math>.  Find the length of <math>\displaystyle AB</math> (in cm) if <math>\displaystyle BC = 19</math> cm and <math>\displaystyle PQ = 87</math> cm.
+
Rectangle <math>ABCD</math> is divided into four parts of equal area by five segments as shown in the figure, where <math>XY = YB + BC + CZ = ZW = WD + DA + AX</math>, and <math>PQ</math> is parallel to <math>AB</math>.  Find the length of <math>AB</math> (in cm) if <math>BC = 19</math> cm and <math>PQ = 87</math> cm.
  
 
[[Image:AIME_1987_Problem_6.png]]
 
[[Image:AIME_1987_Problem_6.png]]
Line 32: Line 34:
  
 
== Problem 7 ==
 
== Problem 7 ==
−
Let <math>\displaystyle [r,s]</math> denote the least common multiple of positive integers <math>\displaystyle r</math> and <math>\displaystyle s</math>.  Find the number of ordered triples <math>\displaystyle (a,b,c)</math> of positive integers for which <math>\displaystyle [a,b] = 1000</math>, <math>\displaystyle [b,c] = 2000</math>, and <math>\displaystyle [c,a] = 2000</math>.
+
Let <math>[r,s]</math> denote the least common multiple of positive integers <math>r</math> and <math>s</math>.  Find the number of ordered triples <math>(a,b,c)</math> of positive integers for which <math>[a,b] = 1000</math>, <math>[b,c] = 2000</math>, and <math>[c,a] = 2000</math>.
  
 
[[1987 AIME Problems/Problem 7|Solution]]
 
[[1987 AIME Problems/Problem 7|Solution]]
  
 
== Problem 8 ==
 
== Problem 8 ==
−
What is the largest positive integer <math>\displaystyle n</math> for which there is a unique integer <math>\displaystyle k</math> such that <math>\displaystyle \frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}</math>?
+
What is the largest positive integer <math>n</math> for which there is a unique integer <math>k</math> such that <math>\frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}</math>?
  
 
[[1987 AIME Problems/Problem 8|Solution]]
 
[[1987 AIME Problems/Problem 8|Solution]]
  
 
== Problem 9 ==
 
== Problem 9 ==
−
Triangle <math>\displaystyle ABC</math> has right angle at <math>\displaystyle B</math>, and contains a point <math>\displaystyle P</math> for which <math>\displaystyle PA = 10</math>, <math>\displaystyle PB = 6</math>, and <math>\displaystyle \angle APB = \angle BPC = \angle CPA</math>.  Find <math>\displaystyle PC</math>.
+
Triangle <math>ABC</math> has right angle at <math>B</math>, and contains a point <math>P</math> for which <math>PA = 10</math>, <math>PB = 6</math>, and <math>\angle APB = \angle BPC = \angle CPA</math>.  Find <math>PC</math>.
  
 
[[Image:AIME_1987_Problem_9.png]]
 
[[Image:AIME_1987_Problem_9.png]]
Line 54: Line 56:
  
 
== Problem 11 ==
 
== Problem 11 ==
−
Find the largest possible value of <math>\displaystyle k</math> for which <math>\displaystyle 3^{11}</math> is expressible as the sum of <math>\displaystyle k</math> consecutive positive integers.
+
Find the largest possible value of <math>k</math> for which <math>3^{11}</math> is expressible as the sum of <math>k</math> consecutive positive integers.
  
 
[[1987 AIME Problems/Problem 11|Solution]]
 
[[1987 AIME Problems/Problem 11|Solution]]
  
 
== Problem 12 ==
 
== Problem 12 ==
−
Let <math>\displaystyle m</math> be the smallest integer whose cube root is of the form <math>\displaystyle n+r</math>, where <math>\displaystyle n</math> is a positive integer and <math>\displaystyle r</math> is a positive real number less than <math>\displaystyle 1/1000</math>. Find <math>\displaystyle n</math>.
+
Let <math>m</math> be the smallest [[integer]] whose cube root is of the form <math>n+r</math>, where <math>n</math> is a [[positive integer]] and <math>r</math> is a positive real number less than <math>1/1000</math>. Find <math>n</math>.
  
 
[[1987 AIME Problems/Problem 12|Solution]]
 
[[1987 AIME Problems/Problem 12|Solution]]
  
 
== Problem 13 ==
 
== Problem 13 ==
−
A given sequence <math>\displaystyle r_1, r_2, \dots, r_n</math> 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, <math>\displaystyle r_n</math>, with its current predecessor and exchanging them if and only if the last term is smaller.  
+
A given sequence <math>r_1, r_2, \dots, r_n</math> 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, <math>r_n</math>, 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.
 
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.
Line 71: Line 73:
 
<center><math>1 \quad 8 \quad \underline{9 \quad 7}</math></center>
 
<center><math>1 \quad 8 \quad \underline{9 \quad 7}</math></center>
 
<center><math>1 \quad 8 \quad 7 \quad 9</math></center>
 
<center><math>1 \quad 8 \quad 7 \quad 9</math></center>
−
Suppose that <math>\displaystyle n = 40</math>, and that the terms of the initial sequence <math>\displaystyle r_1, r_2, \dots, r_{40}</math> are distinct from one another and are in random order.  Let <math>\displaystyle p/q</math>, in lowest terms, be the probability that the number that begins as <math>\displaystyle r_{20}</math> will end up, after one bubble pass, in the <math>\displaystyle 30^{\mbox{th}}</math> place.  Find <math>\displaystyle p + q</math>.
+
Suppose that <math>n = 40</math>, and that the terms of the initial sequence <math>r_1, r_2, \dots, r_{40}</math> are distinct from one another and are in random order.  Let <math>p/q</math>, in lowest terms, be the probability that the number that begins as <math>r_{20}</math> will end up, after one bubble pass, in the <math>30^{\mbox{th}}</math> place.  Find <math>p + q</math>.
  
 
[[1987 AIME Problems/Problem 13|Solution]]
 
[[1987 AIME Problems/Problem 13|Solution]]
Line 77: Line 79:
 
== Problem 14 ==
 
== Problem 14 ==
 
Compute
 
Compute
−
<center><math>\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)}</math></center>.
+
<cmath>\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)}.</cmath>
  
 
[[1987 AIME Problems/Problem 14|Solution]]
 
[[1987 AIME Problems/Problem 14|Solution]]
  
 
== Problem 15 ==
 
== Problem 15 ==
−
Squares <math>\displaystyle S_1</math> and <math>\displaystyle S_2</math> are inscribed in right triangle <math>\displaystyle ABC</math>, as shown in the figures below. Find <math>\displaystyle AC + CB</math> if area <math>\displaystyle (S_1) = 441</math> and area <math>\displaystyle (S_2) = 440</math>.
+
Squares <math>S_1</math> and <math>S_2</math> are inscribed in right triangle <math>ABC</math>, as shown in the figures below. Find <math>AC + CB</math> if area <math>(S_1) = 441</math> and area <math>(S_2) = 440</math>.
  
 
[[Image:AIME_1987_Problem_15.png]]
 
[[Image:AIME_1987_Problem_15.png]]
Line 89: Line 91:
  
 
== See also ==
 
== See also ==
 +
 +
{{AIME box|year=1987|before=[[1986 AIME Problems]]|after=[[1988 AIME Problems]]}}
 +
 
* [[American Invitational Mathematics Examination]]
 
* [[American Invitational Mathematics Examination]]
 
* [[AIME Problems and Solutions]]
 
* [[AIME Problems and Solutions]]
Line 94: Line 99:
  
 
[[Category:AIME Problems|1987]]
 
[[Category:AIME Problems|1987]]
 +
{{MAA Notice}}

Latest revision as of 14:34, 22 August 2023

1987 AIME (Answer Key)
Printable version | AoPS Contest Collections • PDF

Instructions

  1. This is a 15-question, 3-hour examination. All answers are integers ranging from $000$ to $999$, inclusive. Your score will be the number of correct answers; i.e., there is neither partial credit nor a penalty for wrong answers.
  2. No aids other than scratch paper, graph paper, ruler, compass, and protractor are permitted. In particular, calculators and computers are not permitted.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Problem 1

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

Solution

Problem 2

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

Solution

Problem 3

By a proper divisor 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 $|x-60|+|y|=\left|\frac{x}{4}\right|.$

Solution

Problem 5

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

Solution

Problem 6

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

AIME 1987 Problem 6.png

Solution

Problem 7

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

Solution

Problem 8

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

Solution

Problem 9

Triangle $ABC$ has right angle at $B$, and contains a point $P$ for which $PA = 10$, $PB = 6$, and $\angle APB = \angle BPC = \angle CPA$. Find $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 $k$ for which $3^{11}$ is expressible as the sum of $k$ consecutive positive integers.

Solution

Problem 12

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

Solution

Problem 13

A given sequence $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, $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 $n = 40$, and that the terms of the initial sequence $r_1, r_2, \dots, r_{40}$ are distinct from one another and are in random order. Let $p/q$, in lowest terms, be the probability that the number that begins as $r_{20}$ will end up, after one bubble pass, in the $30^{\mbox{th}}$ place. Find $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 $S_1$ and $S_2$ are inscribed in right triangle $ABC$, as shown in the figures below. Find $AC + CB$ if area $(S_1) = 441$ and area $(S_2) = 440$.

AIME 1987 Problem 15.png

Solution

See also

1987 AIME (Problems • Answer Key • Resources)
Preceded by
1986 AIME Problems 		Followed by
1988 AIME Problems
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

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