Difference between revisions of "2008 AIME I Problems"

m (Problem 11)
m (Undo revision 197485 by Beishexi (talk))
(Tag: Undo)
 
(12 intermediate revisions by 8 users not shown)
Line 1: Line 1:
 +
{{AIME Problems|year=2008|n=I}}
 +
 
== Problem 1 ==
 
== Problem 1 ==
Of the students attending a school party, <math>60</math>% of the students are girls, and <math>40</math>% of the students like to dance. After these students are joined by <math>20</math> more boy students, all of whom like to dance, the party is now <math>58</math>% girls. How many students now at the party like to dance?
+
Of the students attending a school party, <math>60\%</math> of the students are girls, and <math>40\%</math> of the students like to dance. After these students are joined by <math>20</math> more boy students, all of whom like to dance, the party is now <math>58\%</math> girls. How many students now at the party like to dance?
  
 
[[2008 AIME I Problems/Problem 1|Solution]]
 
[[2008 AIME I Problems/Problem 1|Solution]]
Line 52: Line 54:
  
 
== Problem 11 ==
 
== Problem 11 ==
Consider sequences that consist entirely of <math>A</math>'s and <math>B</math>'s and that have the property that every run of consecutive <math>A</math>'s has even length, and every run of consecutive <math>B</math>'s has odd length.. Examples of such sequences are <math>AA</math>, <math>B</math>, and <math>AABAA</math>, while <math>BBAB</math> is not such a sequence. How many such sequences have length 14?
+
Consider sequences that consist entirely of <math>A</math>'s and <math>B</math>'s and that have the property that every run of consecutive <math>A</math>'s has even length, and every run of consecutive <math>B</math>'s has odd length. Examples of such sequences are <math>AA</math>, <math>B</math>, and <math>AABAA</math>, while <math>BBAB</math> is not such a sequence. How many such sequences have length 14?
  
 
[[2008 AIME I Problems/Problem 11|Solution]]
 
[[2008 AIME I Problems/Problem 11|Solution]]
  
 
== Problem 12 ==
 
== Problem 12 ==
On a long straight stretch of one-way single-lane highway, cars all travel at the same speed and all obey the safety rule: the distance form the back of the car ahead to the front of the car behind is exactly one car length for each 15 kilometers per hour of speed or fraction thereof (Thus the front of a car traveling 52 kilometers per hour will be four car lengths behind the back of the car in front of it.) A photoelectric eye by the side of the road counts the number of cars that pass in one hour. Assuming that each car is 4 meters long and that the cars can travel at any speed, let <math>M</math> be the maximum whole number of cars that can pass the photoelectric eye in one hour. Find the quotient when <math>M</math> is divided by 10.
+
On a long straight stretch of one-way single-lane highway, cars all travel at the same speed and all obey the safety rule: the distance from the back of the car ahead to the front of the car behind is exactly one car length for each 15 kilometers per hour of speed or fraction thereof (Thus the front of a car traveling 52 kilometers per hour will be four car lengths behind the back of the car in front of it.) A photoelectric eye by the side of the road counts the number of cars that pass in one hour. Assuming that each car is 4 meters long and that the cars can travel at any speed, let <math>M</math> be the maximum whole number of cars that can pass the photoelectric eye in one hour. Find the quotient when <math>M</math> is divided by 10.
  
 
[[2008 AIME I Problems/Problem 12|Solution]]
 
[[2008 AIME I Problems/Problem 12|Solution]]
Line 75: Line 77:
  
 
== Problem 14 ==
 
== Problem 14 ==
Let <math>\overline{AB}</math> be a diameter of circle <math>\omega</math>. Extend <math>\overline{AB}</math> through <math>A</math> to <math>C</math>. Point <math>T</math> lies on <math>\omega</math> so that line <math>CT</math> is tangent to <math>\omega</math>. Point <math>P</math> is the foot of the perpendicular from <math>A</math> to line <math>CT</math>. Suppose <math>AB = 18</math>, and let <math>m</math> denote the maximum possible length of segment <math>BP</math>. Find <math>m^{2}</math>.
+
Let <math>\overline{AB}</math> be a diameter of circle <math>\omega</math>. Extend <math>\overline{AB}</math> through <math>A</math> to <math>C</math>. Point <math>T</math> lies on <math>\omega</math> so that line <math>CT</math> is tangent to <math>\omega</math>. Point <math>P</math> is the foot of the perpendicular from <math>A</math> to line <math>CT</math>. Suppose <math>\overline{AB} = 18</math>, and let <math>m</math> denote the maximum possible length of segment <math>BP</math>. Find <math>m^{2}</math>.
  
 
[[2008 AIME I Problems/Problem 14|Solution]]
 
[[2008 AIME I Problems/Problem 14|Solution]]
Line 81: Line 83:
 
== Problem 15 ==
 
== Problem 15 ==
 
A square piece of paper has sides of length <math>100</math>. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at distance <math>\sqrt {17}</math> from the corner, and they meet on the diagonal at an angle of <math>60^\circ</math> (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upper edges, can be written in the form <math>\sqrt [n]{m}</math>, where <math>m</math> and <math>n</math> are positive integers, <math>m < 1000</math>, and <math>m</math> is not divisible by the <math>n</math>th power of any prime. Find <math>m + n</math>.
 
A square piece of paper has sides of length <math>100</math>. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at distance <math>\sqrt {17}</math> from the corner, and they meet on the diagonal at an angle of <math>60^\circ</math> (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upper edges, can be written in the form <math>\sqrt [n]{m}</math>, where <math>m</math> and <math>n</math> are positive integers, <math>m < 1000</math>, and <math>m</math> is not divisible by the <math>n</math>th power of any prime. Find <math>m + n</math>.
 +
<center><asy>import cse5;
 +
size(200);
 +
pathpen=black;
 +
real s=sqrt(17);
 +
real r=(sqrt(51)+s)/sqrt(2);
 +
D((0,2*s)--(0,0)--(2*s,0));
 +
D((0,s)--r*dir(45)--(s,0));
 +
D((0,0)--r*dir(45));
 +
D((r*dir(45).x,2*s)--r*dir(45)--(2*s,r*dir(45).y));
 +
MP("30^\circ",r*dir(45)-(0.25,1),SW);
 +
MP("30^\circ",r*dir(45)-(1,0.5),SW);
 +
MP("\sqrt{17}",(0,s/2),W);
 +
MP("\sqrt{17}",(s/2,0),S);
 +
MP("\mathrm{cut}",((0,s)+r*dir(45))/2,N);
 +
MP("\mathrm{cut}",((s,0)+r*dir(45))/2,E);
 +
MP("\mathrm{fold}",(r*dir(45).x,s+r/2*dir(45).y),E);
 +
MP("\mathrm{fold}",(s+r/2*dir(45).x,r*dir(45).y));</asy></center>
  
 
[[2008 AIME I Problems/Problem 15|Solution]]
 
[[2008 AIME I Problems/Problem 15|Solution]]
  
 
== See also ==
 
== See also ==
 +
{{AIME box|year=2008|n=I|before=[[2007 AIME II Problems]]|after=[[2008 AIME II Problems]]}}
 
* [[American Invitational Mathematics Examination]]
 
* [[American Invitational Mathematics Examination]]
 
* [[AIME Problems and Solutions]]
 
* [[AIME Problems and Solutions]]
 
* [[Mathematics competition resources]]
 
* [[Mathematics competition resources]]
 +
{{MAA Notice}}

Latest revision as of 23:46, 25 August 2023

2008 AIME I (Answer Key)
Printable version | AoPS Contest CollectionsPDF

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

Of the students attending a school party, $60\%$ of the students are girls, and $40\%$ of the students like to dance. After these students are joined by $20$ more boy students, all of whom like to dance, the party is now $58\%$ girls. How many students now at the party like to dance?

Solution

Problem 2

Square $AIME$ has sides of length $10$ units. Isosceles triangle $GEM$ has base $EM$, and the area common to triangle $GEM$ and square $AIME$ is $80$ square units. Find the length of the altitude to $EM$ in $\triangle GEM$.

Solution

Problem 3

Ed and Sue bike at equal and constant rates. Similarly, they jog at equal and constant rates, and they swim at equal and constant rates. Ed covers $74$ kilometers after biking for $2$ hours, jogging for $3$ hours, and swimming for $4$ hours, while Sue covers $91$ kilometers after jogging for $2$ hours, swimming for $3$ hours, and biking for $4$ hours. Their biking, jogging, and swimming rates are all whole numbers of kilometers per hour. Find the sum of the squares of Ed's biking, jogging, and swimming rates.

Solution

Problem 4

There exist unique positive integers $x$ and $y$ that satisfy the equation $x^2 + 84x + 2008 = y^2$. Find $x + y$.

Solution

Problem 5

A right circular cone has base radius $r$ and height $h$. The cone lies on its side on a flat table. As the cone rolls on the surface of the table without slipping, the point where the cone's base meets the table traces a circular arc centered at the point where the vertex touches the table. The cone first returns to its original position on the table after making $17$ complete rotations. The value of $h/r$ can be written in the form $m\sqrt {n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$.

Solution

Problem 6

A triangular array of numbers has a first row consisting of the odd integers $1,3,5,\ldots,99$ in increasing order. Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry. Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row immediately above it. How many entries in the array are multiples of $67$?

Solution

Problem 7

Let $S_i$ be the set of all integers $n$ such that $100i\leq n < 100(i + 1)$. For example, $S_4$ is the set ${400,401,402,\ldots,499}$. How many of the sets $S_0, S_1, S_2, \ldots, S_{999}$ do not contain a perfect square?

Solution

Problem 8

Find the positive integer $n$ such that

\[\arctan\frac {1}{3} + \arctan\frac {1}{4} + \arctan\frac {1}{5} + \arctan\frac {1}{n} = \frac {\pi}{4}.\]

Solution

Problem 9

Ten identical crates each of dimensions $3$ ft $\times$ $4$ ft $\times$ $6$ ft. The first crate is placed flat on the floor. Each of the remaining nine crates is placed, in turn, flat on top of the previous crate, and the orientation of each crate is chosen at random. Let $\frac {m}{n}$ be the probability that the stack of crates is exactly $41$ ft tall, where $m$ and $n$ are relatively prime positive integers. Find $m$.

Solution

Problem 10

Let $ABCD$ be an isosceles trapezoid with $\overline{AD}||\overline{BC}$ whose angle at the longer base $\overline{AD}$ is $\dfrac{\pi}{3}$. The diagonals have length $10\sqrt {21}$, and point $E$ is at distances $10\sqrt {7}$ and $30\sqrt {7}$ from vertices $A$ and $D$, respectively. Let $F$ be the foot of the altitude from $C$ to $\overline{AD}$. The distance $EF$ can be expressed in the form $m\sqrt {n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$.

Solution

Problem 11

Consider sequences that consist entirely of $A$'s and $B$'s and that have the property that every run of consecutive $A$'s has even length, and every run of consecutive $B$'s has odd length. Examples of such sequences are $AA$, $B$, and $AABAA$, while $BBAB$ is not such a sequence. How many such sequences have length 14?

Solution

Problem 12

On a long straight stretch of one-way single-lane highway, cars all travel at the same speed and all obey the safety rule: the distance from the back of the car ahead to the front of the car behind is exactly one car length for each 15 kilometers per hour of speed or fraction thereof (Thus the front of a car traveling 52 kilometers per hour will be four car lengths behind the back of the car in front of it.) A photoelectric eye by the side of the road counts the number of cars that pass in one hour. Assuming that each car is 4 meters long and that the cars can travel at any speed, let $M$ be the maximum whole number of cars that can pass the photoelectric eye in one hour. Find the quotient when $M$ is divided by 10.

Solution

Problem 13

Let

$p(x,y) = a_0 + a_1x + a_2y + a_3x^2 + a_4xy + a_5y^2 + a_6x^3 + a_7x^2y + a_8xy^2 + a_9y^3$.

Suppose that

$p(0,0) = p(1,0) = p( - 1,0) = p(0,1) = p(0, - 1) = p(1,1) = p(1, - 1) = p(2,2) = 0$.

There is a point $\left(\frac {a}{c},\frac {b}{c}\right)$ for which $p\left(\frac {a}{c},\frac {b}{c}\right) = 0$ for all such polynomials, where $a$, $b$, and $c$ are positive integers, $a$ and $c$ are relatively prime, and $c > 1$. Find $a + b + c$.

Solution

Problem 14

Let $\overline{AB}$ be a diameter of circle $\omega$. Extend $\overline{AB}$ through $A$ to $C$. Point $T$ lies on $\omega$ so that line $CT$ is tangent to $\omega$. Point $P$ is the foot of the perpendicular from $A$ to line $CT$. Suppose $\overline{AB} = 18$, and let $m$ denote the maximum possible length of segment $BP$. Find $m^{2}$.

Solution

Problem 15

A square piece of paper has sides of length $100$. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at distance $\sqrt {17}$ from the corner, and they meet on the diagonal at an angle of $60^\circ$ (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upper edges, can be written in the form $\sqrt [n]{m}$, where $m$ and $n$ are positive integers, $m < 1000$, and $m$ is not divisible by the $n$th power of any prime. Find $m + n$.

[asy]import cse5; size(200); pathpen=black; real s=sqrt(17); real r=(sqrt(51)+s)/sqrt(2); D((0,2*s)--(0,0)--(2*s,0)); D((0,s)--r*dir(45)--(s,0)); D((0,0)--r*dir(45)); D((r*dir(45).x,2*s)--r*dir(45)--(2*s,r*dir(45).y)); MP("30^\circ",r*dir(45)-(0.25,1),SW); MP("30^\circ",r*dir(45)-(1,0.5),SW); MP("\sqrt{17}",(0,s/2),W); MP("\sqrt{17}",(s/2,0),S); MP("\mathrm{cut}",((0,s)+r*dir(45))/2,N); MP("\mathrm{cut}",((s,0)+r*dir(45))/2,E); MP("\mathrm{fold}",(r*dir(45).x,s+r/2*dir(45).y),E); MP("\mathrm{fold}",(s+r/2*dir(45).x,r*dir(45).y));[/asy]

Solution

See also

2008 AIME I (ProblemsAnswer KeyResources)
Preceded by
2007 AIME II Problems
Followed by
2008 AIME II 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