Difference between revisions of "1993 AIME Problems"

Latest revision as of 05:55, 2 September 2021

1993 AIME (Answer Key) Printable version \| AoPS Contest Collections • 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 and computers are not permitted.
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Problem 1

How many even integers between 4000 and 7000 have four different digits?

Solution

Problem 2

During a recent campaign for office, a candidate made a tour of a country which we assume lies in a plane. On the first day of the tour he went east, on the second day he went north, on the third day west, on the fourth day south, on the fifth day east, etc. If the candidate went $\frac{n^{2}}{2}$ miles on the $n^{\mbox{th}}_{}$ day of this tour, how many miles was he from his starting point at the end of the $40^{\mbox{th}}_{}$ day?

Solution

Problem 3

The table below displays some of the results of last summer's Frostbite Falls Fishing Festival, showing how many contestants caught $n\,$ fish for various values of $n\,$ .

$\begin{array}{|c|c|c|c|c|c|c|c|c|} \hline n & 0 & 1 & 2 & 3 & \dots & 13 & 14 & 15 \\ \hline \text{number of contestants who caught} \ n \ \text{fish} & 9 & 5 & 7 & 23 & \dots & 5 & 2 & 1 \\ \hline \end{array}$

In the newspaper story covering the event, it was reported that

(a) the winner caught $15$ fish;

(b) those who caught $3$ or more fish averaged $6$ fish each;

(c) those who caught $12$ or fewer fish averaged $5$ fish each.

What was the total number of fish caught during the festival?

Solution

Problem 4

How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ ?

Solution

Problem 5

Let $P_0(x) = x^3 + 313x^2 - 77x - 8\,$ . For integers $n \ge 1\,$ , define $P_n(x) = P_{n - 1}(x - n)\,$ . What is the coefficient of $x\,$ in $P_{20}(x)\,$ ?

Solution

Problem 6

What is the smallest positive integer than can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers?

Solution

Problem 7

Three numbers, $a_1, a_2, a_3$ , are drawn randomly and without replacement from the set $\{1, 2, 3,\ldots, 1000\}$ . Three other numbers, $b_1, b_2, b_3$ , are then drawn randomly and without replacement from the remaining set of $997$ numbers. Let $p$ be the probability that, after suitable rotation, a brick of dimensions $a_1 \times a_2 \times a_3$ can be enclosed in a box of dimension $b_1 \times b_2 \times b_3$ , with the sides of the brick parallel to the sides of the box. If $p$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator?

Solution

Problem 8

Let $S\,$ be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of $S\,$ so that the union of the two subsets is $S\,$ ? The order of selection does not matter; for example, the pair of subsets $\{a, c\},\{b, c, d, e, f\}$ represents the same selection as the pair $\{b, c, d, e, f\},\{a, c\}.$

Solution

Problem 9

Two thousand points are given on a circle. Label one of the points 1. From this point, count 2 points in the clockwise direction and label this point 2. From the point labeled 2, count 3 points in the clockwise direction and label this point 3. (See figure.) Continue this process until the labels $1,2,3\dots,1993\,$ are all used. Some of the points on the circle will have more than one label and some points will not have a label. What is the smallest integer that labels the same point as 1993?

Solution

Problem 10

Euler's formula states that for a convex polyhedron with $V\,$ vertices, $E\,$ edges, and $F\,$ faces, $V-E+F=2\,$ . A particular convex polyhedron has 32 faces, each of which is either a triangle or a pentagon. At each of its $V\,$ vertices, $T\,$ triangular faces and $P^{}_{}$ pentagonal faces meet. What is the value of $100P+10T+V\,$ ?

Solution

Problem 11

Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. What are the last three digits of $m+n\,$ ?

Solution

Problem 12

The vertices of $\triangle ABC$ are $A = (0,0)\,$ , $B = (0,420)\,$ , and $C = (560,0)\,$ . The six faces of a die are labeled with two $A\,$ 's, two $B\,$ 's, and two $C\,$ 's. Point $P_1 = (k,m)\,$ is chosen in the interior of $\triangle ABC$ , and points $P_2\,$ , $P_3\,$ , $P_4, \dots$ are generated by rolling the die repeatedly and applying the rule: If the die shows label $L\,$ , where $L \in \{A, B, C\}$ , and $P_n\,$ is the most recently obtained point, then $P_{n + 1}^{}$ is the midpoint of $\overline{P_n L}$ . Given that $P_7 = (14,92)\,$ , what is $k + m\,$ ?

Solution

Problem 13

Jenny and Kenny are walking in the same direction, Kenny at 3 feet per second and Jenny at 1 foot per second, on parallel paths that are 200 feet apart. A tall circular building 100 feet in diameter is centered midway between the paths. At the instant when the building first blocks the line of sight between Jenny and Kenny, they are 200 feet apart. Let $t\,$ be the amount of time, in seconds, before Jenny and Kenny can see each other again. If $t\,$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator?

Solution

Problem 14

A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called unstuck if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}\,$ , for a positive integer $N\,$ . Find $N\,$ .

Solution

Problem 15

Let $\overline{CH}$ be an altitude of $\triangle ABC$ . Let $R\,$ and $S\,$ be the points where the circles inscribed in the triangles $ACH\,$ and $BCH^{}_{}$ are tangent to $\overline{CH}$ . If $AB = 1995\,$ , $AC = 1994\,$ , and $BC = 1993\,$ , then $RS\,$ can be expressed as $m/n\,$ , where $m\,$ and $n\,$ are relatively prime integers. Find $m + n\,$ .

Solution

@@ Line 40: / Line 40: @@
 == Problem 7 ==
-Three numbers, <math>a_1\,</math>, <math>a_2\,</math>, <math>a_3\,</math>, are drawn randomly and without replacement from the set <math>\{1, 2, 3, \dots, 1000\}\,</math>.  Three other numbers, <math>b_1\,</math>, <math>b_2\,</math>, <math>b_3\,</math>, are then drawn randomly and without replacement from the remaining set of 997 numbers.  Let <math>p\,</math> be the probability that, after a suitable rotation, a brick of dimensions <math>a_1 \times a_2 \times a_3\,</math> can be enclosed in a box of dimensions <math>b_1 \times b_2 \times b_3\,</math>, with the sides of the brick parallel to the sides of the box.  If <math>p\,</math> is written as a fraction in lowest terms, what is the sum of the numerator and denominator?
+Three numbers, <math>a_1, a_2, a_3</math>, are drawn randomly and without replacement from the set <math>\{1, 2, 3,\ldots, 1000\}</math>. Three other numbers, <math>b_1, b_2, b_3</math>, are then drawn randomly and without replacement from the remaining set of <math>997</math> numbers. Let <math>p</math> be the probability that, after suitable rotation, a brick of dimensions <math>a_1 \times a_2 \times a_3</math> can be enclosed in a box of dimension <math>b_1 \times b_2 \times b_3</math>, with the sides of the brick parallel to the sides of the box. If <math>p</math> is written as a fraction in lowest terms, what is the sum of the numerator and denominator?
 [[1993 AIME Problems/Problem 7|Solution]]
 == Problem 8 ==
-Let <math>S\,</math> be a set with six elements.  In how many different ways can one select two not necessarily distinct subsets of <math>S\,</math> so that the union of the two subsets is <math>S\,</math>?  The order of selection does not matter; for example, the pair of subsets <math>\{a, c\}\,</math>, <math>\{b, c, d, e, f\}\,</math> represents the same selection as the pair <math>\{b, c, d, e, f\}\,</math>, <math>\{a, c\}\,</math>.
+Let <math>S\,</math> be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of <math>S\,</math> so that the union of the two subsets is <math>S\,</math>?  The order of selection does not matter; for example, the pair of subsets <math>\{a, c\},\{b, c, d, e, f\}</math> represents the same selection as the pair <math>\{b, c, d, e, f\},\{a, c\}.</math>
 [[1993 AIME Problems/Problem 8|Solution]]

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

Page

Toolbox

Search

Difference between revisions of "1993 AIME Problems"

Latest revision as of 05:55, 2 September 2021

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