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 "1992 AIME Problems"

m (→‎Problem 8)
(→‎Problem 3)
 
(11 intermediate revisions by 9 users not shown)
Line 12: Line 12:
  
 
== Problem 3 ==
 
== Problem 3 ==
−
A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly <math>.500</math>. During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than <math>.503</math>. What's the largest number of matches she could've won before the weekend began?
+
A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly <math>0.500</math>. During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than <math>.503</math>. What's the largest number of matches she could've won before the weekend began?
  
 
[[1992 AIME Problems/Problem 3|Solution]]
 
[[1992 AIME Problems/Problem 3|Solution]]
  
 
== Problem 4 ==
 
== Problem 4 ==
−
In Pascal's Triangle, each entry is the sum of the two entries above it. In which row of Pascal's Triangle do three consecutive entries occur that are in the ratio <math>3: 4: 5</math>?
+
In Pascal's Triangle, each entry is the sum of the two entries above it. The first few rows of the triangle are shown below.
 +
 
 +
<cmath>\begin{array}{c@{\hspace{8em}}
 +
c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{4pt}}c@{\hspace{2pt}}
 +
c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{3pt}}c@{\hspace{6pt}}
 +
c@{\hspace{6pt}}c@{\hspace{6pt}}c} \vspace{4pt}
 +
\text{Row 0: } &    &    &    &    &    &    & 1 &    &    &    &    &    &  \\\vspace{4pt}
 +
\text{Row 1: } &    &    &    &    &    & 1 &    & 1  &    &    &    &    &  \\\vspace{4pt}
 +
\text{Row 2: } &    &    &    &    & 1 &    & 2 &    & 1  &    &    &    &  \\\vspace{4pt}
 +
\text{Row 3: } &    &    &    &  1 &    & 3 &    & 3  &    & 1 &    &    &  \\\vspace{4pt}
 +
\text{Row 4: } &    &    & 1  &    & 4 &    & 6 &    & 4  &    & 1 &    &  \\\vspace{4pt}
 +
\text{Row 5: } &    & 1 &    & 5  &    &10&    &10 &    & 5 &    & 1 &  \\\vspace{4pt}
 +
\text{Row 6: } & 1 &    & 6  &    &15&    &20&    &15 &    & 6 &    & 1
 +
\end{array}</cmath>In which row of Pascal's Triangle do three consecutive entries occur that are in the ratio <math>3: 4: 5</math>?  
  
 
[[1992 AIME Problems/Problem 4|Solution]]
 
[[1992 AIME Problems/Problem 4|Solution]]
Line 37: Line 50:
  
 
== Problem 8 ==
 
== Problem 8 ==
−
For any sequence of real numbers <math>A=(a_1,a_2,a_3,\ldots)</math>, define <math>\Delta A^{}_{}</math> to be the sequence <math>(a_2-a_1,a_3-a_2,a_4-a_3,\ldots)</math>, whose <math>n^\mbox{th}_{}</math> term is <math>a_{n+1}-a_n^{}</math>. Suppose that all of the terms of the sequence <math>\Delta(\Delta A^{}_{})</math> are <math>1^{}_{}</math>, and that <math>a_{19}=a_{92}^{}=0</math>. Find <math>a_1^{}</math>.
+
For any sequence of real numbers <math>A=(a_1,a_2,a_3,\ldots)</math>, define <math>\Delta A^{}_{}</math> to be the sequence <math>(a_2-a_1,a_3-a_2,a_4-a_3,\ldots)</math>, whose <math>n^{th}</math> term is <math>a_{n+1}-a_n^{}</math>. Suppose that all of the terms of the sequence <math>\Delta(\Delta A^{}_{})</math> are <math>1^{}_{}</math>, and that <math>a_{19}=a_{92}^{}=0</math>. Find <math>a_1^{}</math>.
  
 
[[1992 AIME Problems/Problem 8|Solution]]
 
[[1992 AIME Problems/Problem 8|Solution]]
Line 57: Line 70:
  
 
== Problem 12 ==
 
== Problem 12 ==
−
In a game of ''Chomp'', two players alternately take bites from a 5-by-7 grid of unit squares. To take a bite, a player chooses one of the remaining squares, then removes ("eats") all squares in the quadrant defined by the left edge (extended upward) and the lower edge (extended rightward) of the chosen square. For example, the bite determined by the shaded square in the diagram would remove the shaded square and the four squares marked by <math>\times.</math> (The squares with two or more dotted edges have been removed form the original board in previous moves.)  
+
In a game of ''Chomp'', two players alternately take bites from a 5-by-7 grid of unit squares. To take a bite, a player chooses one of the remaining squares, then removes ("eats") all squares in the quadrant defined by the left edge (extended upward) and the lower edge (extended rightward) of the chosen square. For example, the bite determined by the shaded square in the diagram would remove the shaded square and the four squares marked by <math>\times.</math> (The squares with two or more dotted edges have been removed from the original board in previous moves.)  
  
 
[[Image:AIME_1992_Problem_12.png]]
 
[[Image:AIME_1992_Problem_12.png]]
Line 76: Line 89:
  
 
== Problem 15 ==
 
== Problem 15 ==
−
Define a positive integer <math>n^{}_{}</math> to be a factorial tail if there is some positive integer <math>m^{}_{}</math> such that the decimal representation of <math>m!</math> ends with exactly <math>n</math> zeroes. How many positiive integers less than <math>1992</math> are not factorial tails?
+
Define a positive integer <math>n^{}_{}</math> to be a factorial tail if there is some positive integer <math>m^{}_{}</math> such that the decimal representation of <math>m!</math> ends with exactly <math>n</math> zeroes. How many positive integers less than <math>1992</math> are not factorial tails?
  
 
[[1992 AIME Problems/Problem 15|Solution]]
 
[[1992 AIME Problems/Problem 15|Solution]]
  
 
== See also ==
 
== See also ==
 +
 +
{{AIME box|year=1992|before=[[1991 AIME Problems]]|after=[[1993 AIME Problems]]}}
 +
 
* [[American Invitational Mathematics Examination]]
 
* [[American Invitational Mathematics Examination]]
 
* [[AIME Problems and Solutions]]
 
* [[AIME Problems and Solutions]]
Line 86: Line 102:
  
 
[[Category:AIME Problems]]
 
[[Category:AIME Problems]]
 +
{{MAA Notice}}

Latest revision as of 04:32, 11 November 2023

1992 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

Find the sum of all positive rational numbers that are less than 10 and that have denominator 30 when written in lowest terms.

Solution

Problem 2

A positive integer is called ascending if, in its decimal representation, there are at least two digits and each digit is less than any digit to its right. How many ascending positive integers are there?

Solution

Problem 3

A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly $0.500$. During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than $.503$. What's the largest number of matches she could've won before the weekend began?

Solution

Problem 4

In Pascal's Triangle, each entry is the sum of the two entries above it. The first few rows of the triangle are shown below.

\[\begin{array}{c@{\hspace{8em}} c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{4pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{3pt}}c@{\hspace{6pt}} c@{\hspace{6pt}}c@{\hspace{6pt}}c} \vspace{4pt} \text{Row 0: } & & & & & & & 1 & & & & & & \\\vspace{4pt} \text{Row 1: } & & & & & & 1 & & 1 & & & & & \\\vspace{4pt} \text{Row 2: } & & & & & 1 & & 2 & & 1 & & & & \\\vspace{4pt} \text{Row 3: } & & & & 1 & & 3 & & 3 & & 1 & & & \\\vspace{4pt} \text{Row 4: } & & & 1 & & 4 & & 6 & & 4 & & 1 & & \\\vspace{4pt} \text{Row 5: } & & 1 & & 5 & &10& &10 & & 5 & & 1 & \\\vspace{4pt} \text{Row 6: } & 1 & & 6 & &15& &20& &15 & & 6 & & 1 \end{array}\]In which row of Pascal's Triangle do three consecutive entries occur that are in the ratio $3: 4: 5$?

Solution

Problem 5

Let $S^{}_{}$ be the set of all rational numbers $r^{}_{}$, $0^{}_{}<r<1$, that have a repeating decimal expansion in the form $0.abcabcabc\ldots=0.\overline{abc}$, where the digits $a^{}_{}$, $b^{}_{}$, and $c^{}_{}$ are not necessarily distinct. To write the elements of $S^{}_{}$ as fractions in lowest terms, how many different numerators are required?

Solution

Problem 6

For how many pairs of consecutive integers in $\{1000,1001,1002^{}_{},\ldots,2000\}$ is no carrying required when the two integers are added?

Solution

Problem 7

Faces $ABC^{}_{}$ and $BCD^{}_{}$ of tetrahedron $ABCD^{}_{}$ meet at an angle of $30^\circ$. The area of face $ABC^{}_{}$ is $120^{}_{}$, the area of face $BCD^{}_{}$ is $80^{}_{}$, and $BC=10^{}_{}$. Find the volume of the tetrahedron.

Solution

Problem 8

For any sequence of real numbers $A=(a_1,a_2,a_3,\ldots)$, define $\Delta A^{}_{}$ to be the sequence $(a_2-a_1,a_3-a_2,a_4-a_3,\ldots)$, whose $n^{th}$ term is $a_{n+1}-a_n^{}$. Suppose that all of the terms of the sequence $\Delta(\Delta A^{}_{})$ are $1^{}_{}$, and that $a_{19}=a_{92}^{}=0$. Find $a_1^{}$.

Solution

Problem 9

Trapezoid $ABCD^{}_{}$ has sides $AB=92^{}_{}$, $BC=50^{}_{}$, $CD=19^{}_{}$, and $AD=70^{}_{}$, with $AB^{}_{}$ parallel to $CD^{}_{}$. A circle with center $P^{}_{}$ on $AB^{}_{}$ is drawn tangent to $BC^{}_{}$ and $AD^{}_{}$. Given that $AP^{}_{}=\frac mn$, where $m^{}_{}$ and $n^{}_{}$ are relatively prime positive integers, find $m+n^{}_{}$.

Solution

Problem 10

Consider the region $A^{}_{}$ in the complex plane that consists of all points $z^{}_{}$ such that both $\frac{z^{}_{}}{40}$ and $\frac{40^{}_{}}{\overline{z}}$ have real and imaginary parts between $0^{}_{}$ and $1^{}_{}$, inclusive. What is the integer that is nearest the area of $A^{}_{}$?

Solution

Problem 11

Lines $l_1^{}$ and $l_2^{}$ both pass through the origin and make first-quadrant angles of $\frac{\pi}{70}$ and $\frac{\pi}{54}$ radians, respectively, with the positive x-axis. For any line $l^{}_{}$, the transformation $R(l)^{}_{}$ produces another line as follows: $l^{}_{}$ is reflected in $l_1^{}$, and the resulting line is reflected in $l_2^{}$. Let $R^{(1)}(l)=R(l)^{}_{}$ and $R^{(n)}(l)^{}_{}=R\left(R^{(n-1)}(l)\right)$. Given that $l^{}_{}$ is the line $y=\frac{19}{92}x^{}_{}$, find the smallest positive integer $m^{}_{}$ for which $R^{(m)}(l)=l^{}_{}$.

Solution

Problem 12

In a game of Chomp, two players alternately take bites from a 5-by-7 grid of unit squares. To take a bite, a player chooses one of the remaining squares, then removes ("eats") all squares in the quadrant defined by the left edge (extended upward) and the lower edge (extended rightward) of the chosen square. For example, the bite determined by the shaded square in the diagram would remove the shaded square and the four squares marked by $\times.$ (The squares with two or more dotted edges have been removed from the original board in previous moves.)

AIME 1992 Problem 12.png

The object of the game is to make one's opponent take the last bite. The diagram shows one of the many subsets of the set of 35 unit squares that can occur during the game of Chomp. How many different subsets are there in all? Include the full board and empty board in your count.

Solution

Problem 13

Triangle $ABC^{}_{}$ has $AB=9^{}_{}$ and $BC: AC=40: 41^{}_{}$. What's the largest area that this triangle can have?

Solution

Problem 14

In triangle $ABC^{}_{}$, $A'$, $B'$, and $C'$ are on the sides $BC$, $AC^{}_{}$, and $AB^{}_{}$, respectively. Given that $AA'$, $BB'$, and $CC'$ are concurrent at the point $O^{}_{}$, and that $\frac{AO^{}_{}}{OA'}+\frac{BO}{OB'}+\frac{CO}{OC'}=92$, find $\frac{AO}{OA'}\cdot \frac{BO}{OB'}\cdot \frac{CO}{OC'}$.

Solution

Problem 15

Define a positive integer $n^{}_{}$ to be a factorial tail if there is some positive integer $m^{}_{}$ such that the decimal representation of $m!$ ends with exactly $n$ zeroes. How many positive integers less than $1992$ are not factorial tails?

Solution

See also

1992 AIME (Problems • Answer Key • Resources)
Preceded by
1991 AIME Problems 		Followed by
1993 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=1992_AIME_Problems&oldid=202234"