1991 AIME Problems

From AoPSWiki

1991 AIME (Answer Key) Printable version: AoPS Resources • PDF \| MathLinks Resources • PDF
Instructions 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. No aids other than scratch paper, graph paper, ruler, compass, and protractor are permitted. In particular, calculators are not permitted.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Problem 1

Find $x^2+y^2_{}$ if $x_{}^{}$ and $y_{}^{}$ are positive integers such that

$xy_{}^{}+x+y = 71$ $x^2y+xy^2 = 880^{}_{}.$

Solution

Problem 2

Rectangle $ABCD_{}^{}$ has sides $\overline {AB}$ of length 4 and $\overline {CB}$ of length 3. Divide $\overline {AB}$ into 168 congruent segments with points $A_{}^{}=P_0, P_1, \ldots, P_{168}=B$ , and divide $\overline {CB}$ into 168 congruent segments with points $C_{}^{}=Q_0, Q_1, \ldots, Q_{168}=B$ . For $1_{}^{} \le k \le 167$ , draw the segments $\overline {P_kQ_k}$ . Repeat this construction on the sides $\overline {AD}$ and $\overline {CD}$ , and then draw the diagonal $\overline {AC}$ . Find the sum of the lengths of the 335 parallel segments drawn.

Solution

Problem 3

Expanding $(1+0.2)^{1000}_{}$ by the binomial theorem and doing no further manipulation gives

${1000 \choose 0}(0.2)^0+{1000 \choose 1}(0.2)^1+{1000 \choose 2}(0.2)^2+\cdots+{1000 \choose 1000}(0.2)^{1000}$ $= A_0 + A_1 + A_2 + \cdots + A_{1000},$

where $A_k = {1000 \choose k}(0.2)^k$ for $k = 0,1,2,\ldots,1000$ . For which $k_{}^{}$ is $A_k^{}$ the largest?

Solution

Problem 4

How many real numbers $x^{}_{}$ satisfy the equation $\frac{1}{5}\log_2 x = \sin (5\pi x)$ ?

Solution

Problem 5

Given a rational number, write it as a fraction in lowest terms and calculate the product of the resulting numerator and denominator. For how many rational numbers between 0 and 1 will be $20_{}^{}!$ the resulting product?

Solution

Problem 6

Suppose $r^{}_{}$ is a real number for which

$\left\lfloor r + \frac{19}{100} \right\rfloor + \left\lfloor r + \frac{20}{100} \right\rfloor + \left\lfloor r + \frac{21}{10...$

Find $\lfloor 100r \rfloor$ . (For real $x^{}_{}$ , $\lfloor x \rfloor$ is the greatest integer less than or equal to $x^{}_{}$ .)

Solution

Problem 7

Find $A^2_{}$ , where $A^{}_{}$ is the sum of the absolute values of all roots of the following equation:

$x = \sqrt{19} + \frac{91}{{\sqrt{19}+\frac{91}{{\sqrt{19}+\frac{91}{{\sqrt{19}+\frac{91}{{\sqrt{19}+\frac{91}{x}}}}}}}}}$

Solution

Problem 8

For how many real numbers $a^{}_{}$ does the quadratic equation $x^2 + ax^{}_{} + 6a=0$ have only integer roots for $x^{}_{}$ ?

Solution

Problem 9

Suppose that $\sec x+\tan x=\frac{22}7$ and that $\csc x+\cot x=\frac mn,$ where $\frac mn$ is in lowest terms. Find $m+n^{}_{}.$

Solution

Problem 10

Two three-letter strings, $aaa^{}_{}$ and $bbb^{}_{}$ , are transmitted electronically. Each string is sent letter by letter. Due to faulty equipment, each of the six letters has a 1/3 chance of being received incorrectly, as an $a^{}_{}$ when it should have been a $b^{}_{}$ , or as a $b^{}_{}$ when it should be an $a^{}_{}$ . However, whether a given letter is received correctly or incorrectly is independent of the reception of any other letter. Let $S_a^{}$ be the three-letter string received when $aaa^{}_{}$ is transmitted and let $S_b^{}$ be the three-letter string received when $bbb^{}_{}$ is transmitted. Let $p$ be the probability that $S_a^{}$ comes before $S_b^{}$ in alphabetical order. When $p$ is written as a fraction in lowest terms, what is its numerator?

Solution

Problem 11

Twelve congruent disks are placed on a circle $C^{}_{}$ of radius 1 in such a way that the twelve disks cover $C^{}_{}$ , no two of the disks overlap, and so that each of the twelve disks is tangent to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the from $\pi(a-b\sqrt{c})$ , where $a,b,c^{}_{}$ are positive integers and $c^{}_{}$ is not divisible by the square of any prime. Find $a+b+c^{}_{}$ .

Solution

Problem 12

Rhombus $PQRS^{}_{}$ is inscribed in rectangle $ABCD^{}_{}$ so that vertices $P^{}_{}$ , $Q^{}_{}$ , $R^{}_{}$ , and $S^{}_{}$ are interior points on sides $\overline{AB}$ , $\overline{BC}$ , $\overline{CD}$ , and $\overline{DA}$ , respectively. It is given that $PB^{}_{}=15$ , $BQ^{}_{}=20$ , $PR^{}_{}=30$ , and $QS^{}_{}=40$ . Let $m/n^{}_{}$ , in lowest terms, denote the perimeter of $ABCD^{}_{}$ . Find $m+n^{}_{}$ .

Solution

Problem 13

A drawer contains a mixture of red socks and blue socks, at most 1991 in all. It so happens that, when two socks are selected randomly without replacement, there is a probability of exactly $\frac{1}{2}$ that both are red or both are blue. What is the largest possible number of red socks in the drawer that is consistent with this data?

Solution

Problem 14

A hexagon is inscribed in a circle. Five of the sides have length 81 and the sixth, denoted by $\overline{AB}$ , has length 31. Find the sum of the lengths of the three diagonals that can be drawn from $A_{}^{}$ .

Solution

Problem 15

For positive integer $n_{}^{}$ , define $S_n^{}$ to be the minimum value of the sum

$\sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2},$

where $a_1,a_2,\ldots,a_n^{}$ are positive real numbers whose sum is 17. There is a unique positive integer $n^{}_{}$ for which $S_n^{}$ is also an integer. Find this $n^{}_{}$ .

Solution

Personal tools

Navigation

Search

Toolbox

1991 AIME Problems

From AoPSWiki

Contents

Problem 1

Problem 2

Problem 3

Problem 4

Problem 5

Problem 6

Problem 7

Problem 8

Problem 9

Problem 10

Problem 11

Problem 12

Problem 13

Problem 14

Problem 15

See also