Difference between revisions of "1994 AIME Problems"

Latest revision as of 06:37, 7 September 2018

1994 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

The increasing sequence $3, 15, 24, 48, \ldots\,$ consists of those positive multiples of 3 that are one less than a perfect square. What is the remainder when the 1994th term of the sequence is divided by 1000?

Solution

Problem 2

A circle with diameter $\overline{PQ}\,$ of length 10 is internally tangent at $P^{}_{}$ to a circle of radius 20. Square $ABCD\,$ is constructed with $A\,$ and $B\,$ on the larger circle, $\overline{CD}\,$ tangent at $Q\,$ to the smaller circle, and the smaller circle outside $ABCD\,$ . The length of $\overline{AB}\,$ can be written in the form $m + \sqrt{n}\,$ , where $m\,$ and $n\,$ are integers. Find $m + n\,$ .

Solution

Problem 3

The function $f_{}^{}$ has the property that, for each real number $x,\,$

$f(x)+f(x-1) = x^2\,$

.

If $f(19)=94,\,$ what is the remainder when $f(94)\,$ is divided by 1000?

Solution

Problem 4

Find the positive integer $n\,$ for which

$\lfloor \log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor=1994$

.

(For real $x\,$ , $\lfloor x\rfloor\,$ is the greatest integer $\le x.\,$ )

Solution

Problem 5

Given a positive integer $n\,$ , let $p(n)\,$ be the product of the non-zero digits of $n\,$ . (If $n\,$ has only one digit, then $p(n)\,$ is equal to that digit.) Let

$S=p(1)+p(2)+p(3)+\cdots+p(999)$

.

What is the largest prime factor of $S\,$ ?

Solution

Problem 6

The graphs of the equations

$y=k, \qquad y=\sqrt{3}x+2k, \qquad y=-\sqrt{3}x+2k,$

are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.\,$ These 63 lines cut part of the plane into equilateral triangles of side $2/\sqrt{3}$ . How many such triangles are formed?

Solution

Problem 7

For certain ordered pairs $(a,b)\,$ of real numbers, the system of equations

$ax+by=1\,$ $x^2+y^2=50\,$

has at least one solution, and each solution is an ordered pair $(x,y)\,$ of integers. How many such ordered pairs $(a,b)\,$ are there?

Solution

Problem 8

The points $(0,0)\,$ , $(a,11)\,$ , and $(b,37)\,$ are the vertices of an equilateral triangle. Find the value of $ab\,$ .

Solution

Problem 9

A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,\,$ where $p\,$ and $q\,$ are relatively prime positive integers. Find $p+q.\,$

Solution

Problem 10

In triangle $ABC,\,$ angle $C$ is a right angle and the altitude from $C\,$ meets $\overline{AB}\,$ at $D.\,$ The lengths of the sides of $\triangle ABC\,$ are integers, $BD=29^3,\,$ and $\cos B=m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. Find $m+n.\,$

Solution

Problem 11

Ninety-four bricks, each measuring $4''\times10''\times19'',$ are to be stacked one on top of another to form a tower 94 bricks tall. Each brick can be oriented so it contributes $4''\,$ or $10''\,$ or $19''\,$ to the total height of the tower. How many different tower heights can be achieved using all 94 of the bricks?

Solution

Problem 12

A fenced, rectangular field measures 24 meters by 52 meters. An agricultural researcher has 1994 meters of fence that can be used for internal fencing to partition the field into congruent, square test plots. The entire field must be partitioned, and the sides of the squares must be parallel to the edges of the field. What is the largest number of square test plots into which the field can be partitioned using all or some of the 1994 meters of fence?

Solution

Problem 13

The equation

$x^{10}+(13x-1)^{10}=0\,$

has 10 complex roots $r_1, \overline{r_1}, r_2, \overline{r_2}, r_3, \overline{r_3}, r_4, \overline{r_4}, r_5, \overline{r_5},\,$ where the bar denotes complex conjugation. Find the value of

$\frac 1{r_1\overline{r_1}}+\frac 1{r_2\overline{r_2}}+\frac 1{r_3\overline{r_3}}+\frac 1{r_4\overline{r_4}}+\frac 1{r_5\overline{r_5}}.$

Solution

Problem 14

A beam of light strikes $\overline{BC}\,$ at point $C\,$ with angle of incidence $\alpha=19.94^\circ\,$ and reflects with an equal angle of reflection as shown. The light beam continues its path, reflecting off line segments $\overline{AB}\,$ and $\overline{BC}\,$ according to the rule: angle of incidence equals angle of reflection. Given that $\beta=\alpha/10=1.994^\circ\,$ and $AB=BC,\,$ determine the number of times the light beam will bounce off the two line segments. Include the first reflection at $C\,$ in your count.

Solution

Problem 15

Given a point $P^{}_{}$ on a triangular piece of paper $ABC,\,$ consider the creases that are formed in the paper when $A, B,\,$ and $C\,$ are folded onto $P.\,$ Let us call $P_{}^{}$ a fold point of $\triangle ABC\,$ if these creases, which number three unless $P^{}_{}$ is one of the vertices, do not intersect. Suppose that $AB=36, AC=72,\,$ and $\angle B=90^\circ.\,$ Then the area of the set of all fold points of $\triangle ABC\,$ can be written in the form $q\pi-r\sqrt{s},\,$ where $q, r,\,$ and $s\,$ are positive integers and $s\,$ is not divisible by the square of any prime. What is $q+r+s\,$ ?

Solution

@@ Line 1: / Line 1: @@
+{{AIME Problems|year=1994}}
 == Problem 1 ==
 The increasing sequence <math>3, 15, 24, 48, \ldots\,</math> consists of those positive multiples of 3 that are one less than a perfect square.  What is the remainder when the 1994th term of the sequence is divided by 1000?
@@ Line 25: / Line 27: @@
 == Problem 5 ==
-Given a positive integer <math>n\,</math>, let <math>p(n)\,</math> be the product of the non-zero digits of <math>n\,</math>.  (If <math>n\,</math> has only one digits, then <math>p(n)\,</math> is equal to that digit.)  Let
+Given a positive integer <math>n\,</math>, let <math>p(n)\,</math> be the product of the non-zero digits of <math>n\,</math>.  (If <math>n\,</math> has only one digit, then <math>p(n)\,</math> is equal to that digit.)  Let
 <center><math>S=p(1)+p(2)+p(3)+\cdots+p(999)</math></center>.
 What is the largest prime factor of <math>S\,</math>?
@@ Line 34: / Line 36: @@
 The graphs of the equations
 <center><math>y=k, \qquad y=\sqrt{3}x+2k, \qquad y=-\sqrt{3}x+2k,</math></center>
-are drawn in the coordinate plane for <math>k=-10,-9,-8,\ldots,9,10.\,</math>  These 63 lines cut part of the plane into equilateral triangles of side <math>2/\sqrt{3}.\,</math>  How many such triangles are formed?
+are drawn in the coordinate plane for <math>k=-10,-9,-8,\ldots,9,10.\,</math>  These 63 lines cut part of the plane into equilateral triangles of side <math>2/\sqrt{3}</math>.  How many such triangles are formed?
 [[1994 AIME Problems/Problem 6|Solution]]
@@ Line 52: / Line 54: @@
 == Problem 9 ==
-A solitarire game is played as follows.  Six distinct pairs of matched tiles are placed in a bag.  The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand.  The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty.  The probability that the bag will be emptied is <math>p/q,\,</math> where <math>p\,</math> and <math>q\,</math> are relatively prime positive integers.  Find <math>p+q.\,</math>
+A solitaire game is played as follows.  Six distinct pairs of matched tiles are placed in a bag.  The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand.  The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty.  The probability that the bag will be emptied is <math>p/q,\,</math> where <math>p\,</math> and <math>q\,</math> are relatively prime positive integers.  Find <math>p+q.\,</math>
 [[1994 AIME Problems/Problem 9|Solution]]
@@ Line 62: / Line 64: @@
 == Problem 11 ==
-Ninety-four bricks, each measuring <math>4''\times10''\times19'',</math> are to stacked one on top of another to form a tower 94 bricks tall.  Each brick can be oriented so it contribues <math>4''\,</math> or <math>10''\,</math> or <math>19''\,</math> to the total height of the tower.  How many differnt tower heights can be achieved using all 94 of the bricks?
+Ninety-four bricks, each measuring <math>4''\times10''\times19'',</math> are to be stacked one on top of another to form a tower 94 bricks tall.  Each brick can be oriented so it contributes <math>4''\,</math> or <math>10''\,</math> or <math>19''\,</math> to the total height of the tower.  How many different tower heights can be achieved using all 94 of the bricks?
 [[1994 AIME Problems/Problem 11|Solution]]
@@ Line 80: / Line 82: @@
 == Problem 14 ==
-A beam of light strikes <math>\overline{BC}\,</math> at point <math>C\,</math> with angle of incidence <math>\alpha=19.94^\circ\,</math> and reflects with an equal angle of reflection as shown.  The light beam continues its path, reflecting off line segments <math>\overline{AB}\,</math> and <math>\overline{BC}\,</math> according to the rule: angle of incidence equals angle of reflection.  Given that <math>\beta=\alpha/10=1.994^\circ\,</math> and <math>AB=AC,\,</math> determine the number of times the light beam will bounce off the two line segments.  Include the first reflection at <math>C\,</math> in your count.
+A beam of light strikes <math>\overline{BC}\,</math> at point <math>C\,</math> with angle of incidence <math>\alpha=19.94^\circ\,</math> and reflects with an equal angle of reflection as shown.  The light beam continues its path, reflecting off line segments <math>\overline{AB}\,</math> and <math>\overline{BC}\,</math> according to the rule: angle of incidence equals angle of reflection.  Given that <math>\beta=\alpha/10=1.994^\circ\,</math> and <math>AB=BC,\,</math> determine the number of times the light beam will bounce off the two line segments.  Include the first reflection at <math>C\,</math> in your count.
 [[Image:AIME_1994_Problem_14.png]]
@@ Line 92: / Line 94: @@
 == See also ==
+{{AIME box|year=1994|before=[[1993 AIME Problems]]|after=[[1995 AIME Problems]]}}
 * [[American Invitational Mathematics Examination]]
 * [[AIME Problems and Solutions]]
 * [[Mathematics competition resources]]
+[[Category:AIME Problems]]
+{{MAA Notice}}

1994 AIME (Problems • Answer Key • Resources)
Preceded by 1993 AIME Problems	Followed by 1995 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 "1994 AIME Problems"

Latest revision as of 06:37, 7 September 2018

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