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 "2009 AIME II Problems"

m
(→‎Problem 5)
 
(5 intermediate revisions by 5 users not shown)
Line 41: Line 41:
  
 
dot(dotted);
 
dot(dotted);
−
label("$E$",Ep,E);
+
label("$E$",Ep,A);
 
label("$A$",A,W);
 
label("$A$",A,W);
 
label("$B$",B,W);
 
label("$B$",B,W);
Line 76: Line 76:
  
 
== Problem 11 ==
 
== Problem 11 ==
−
For certain pairs <math>(m,n)</math> of positive integers with <math>m\geq n</math> there are exactly <math>50</math> distinct positive integers <math>k</math> such that <math>|\log m - \log k| < \log n</math>. Find the sum of all possible values of the product <math>mn</math>.
+
For certain pairs <math>(m,n)</math> of positive integers with <math>m\geq n</math> there are exactly <math>50</math> distinct positive integers <math>k</math> such that <math>|\log m - \log k| < \log n</math>. Find the sum of all possible values of the product <math>m \cdot n</math>.
  
 
[[2009 AIME II Problems/Problem 11|Solution]]
 
[[2009 AIME II Problems/Problem 11|Solution]]
Line 101: Line 101:
  
 
== See also ==
 
== See also ==
 +
{{AIME box|year=2009|n=II|before=[[2009 AIME I Problems]]|after=[[2010 AIME I 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}}
 
{{MAA Notice}}

Latest revision as of 12:59, 24 June 2024

2009 AIME II (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

Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.

Solution

Problem 2

Suppose that $a$, $b$, and $c$ are positive real numbers such that $a^{\log_3 7} = 27$, $b^{\log_7 11} = 49$, and $c^{\log_{11}25} = \sqrt{11}$. Find \[a^{(\log_3 7)^2} + b^{(\log_7 11)^2} + c^{(\log_{11} 25)^2}.\]

Solution

Problem 3

In rectangle $ABCD$, $AB=100$. Let $E$ be the midpoint of $\overline{AD}$. Given that line $AC$ and line $BE$ are perpendicular, find the greatest integer less than $AD$.

Solution

Problem 4

A group of children held a grape-eating contest. When the contest was over, the winner had eaten $n$ grapes, and the child in $k$-th place had eaten $n+2-2k$ grapes. The total number of grapes eaten in the contest was $2009$. Find the smallest possible value of $n$.

Solution

Problem 5

Equilateral triangle $T$ is inscribed in circle $A$, which has radius $10$. Circle $B$ with radius $3$ is internally tangent to circle $A$ at one vertex of $T$. Circles $C$ and $D$, both with radius $2$, are internally tangent to circle $A$ at the other two vertices of $T$. Circles $B$, $C$, and $D$ are all externally tangent to circle $E$, which has radius $\dfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

[asy] unitsize(3mm); defaultpen(linewidth(.8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,A); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E); [/asy]

Solution

Problem 6

Let $m$ be the number of five-element subsets that can be chosen from the set of the first $14$ natural numbers so that at least two of the five numbers are consecutive. Find the remainder when $m$ is divided by $1000$.

Solution

Problem 7

Define $n!!$ to be $n(n-2)(n-4)\cdots 3\cdot 1$ for $n$ odd and $n(n-2)(n-4)\cdots 4\cdot 2$ for $n$ even. When $\sum_{i=1}^{2009} \frac{(2i-1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $2^ab$ with $b$ odd. Find $\dfrac{ab}{10}$.

Solution

Problem 8

Dave rolls a fair six-sided die until a six appears for the first time. Independently, Linda rolls a fair six-sided die until a six appears for the first time. Let $m$ and $n$ be relatively prime positive integers such that $\dfrac mn$ is the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. Find $m+n$.

Solution

Problem 9

Let $m$ be the number of solutions in positive integers to the equation $4x+3y+2z=2009$, and let $n$ be the number of solutions in positive integers to the equation $4x+3y+2z=2000$. Find the remainder when $m-n$ is divided by $1000$.

Solution

Problem 10

Four lighthouses are located at points $A$, $B$, $C$, and $D$. The lighthouse at $A$ is $5$ kilometers from the lighthouse at $B$, the lighthouse at $B$ is $12$ kilometers from the lighthouse at $C$, and the lighthouse at $A$ is $13$ kilometers from the lighthouse at $C$. To an observer at $A$, the angle determined by the lights at $B$ and $D$ and the angle determined by the lights at $C$ and $D$ are equal. To an observer at $C$, the angle determined by the lights at $A$ and $B$ and the angle determined by the lights at $D$ and $B$ are equal. The number of kilometers from $A$ to $D$ is given by $\frac{p\sqrt{r}}{q}$, where $p$, $q$, and $r$ are relatively prime positive integers, and $r$ is not divisible by the square of any prime. Find $p+q+r$.

Solution

Problem 11

For certain pairs $(m,n)$ of positive integers with $m\geq n$ there are exactly $50$ distinct positive integers $k$ such that $|\log m - \log k| < \log n$. Find the sum of all possible values of the product $m \cdot n$.

Solution

Problem 12

From the set of integers $\{1,2,3,\dots,2009\}$, choose $k$ pairs $\{a_i,b_i\}$ with $a_i<b_i$ so that no two pairs have a common element. Suppose that all the sums $a_i+b_i$ are distinct and less than or equal to $2009$. Find the maximum possible value of $k$.

Solution

Problem 13

Let $A$ and $B$ be the endpoints of a semicircular arc of radius $2$. The arc is divided into seven congruent arcs by six equally spaced points $C_1,C_2,\dots,C_6$. All chords of the form $\overline{AC_i}$ or $\overline{BC_i}$ are drawn. Let $n$ be the product of the lengths of these twelve chords. Find the remainder when $n$ is divided by $1000$.

Solution

Problem 14

The sequence $(a_n)$ satisfies $a_0=0$ and $a_{n + 1} = \frac{8}{5}a_n + \frac{6}{5}\sqrt{4^n - a_n^2}$ for $n \geq 0$. Find the greatest integer less than or equal to $a_{10}$.

Solution

Problem 15

Let $\overline{MN}$ be a diameter of a circle with diameter $1$. Let $A$ and $B$ be points on one of the semicircular arcs determined by $\overline{MN}$ such that $A$ is the midpoint of the semicircle and $MB=\dfrac 35$. Point $C$ lies on the other semicircular arc. Let $d$ be the length of the line segment whose endpoints are the intersections of diameter $\overline{MN}$ with the chords $\overline{AC}$ and $\overline{BC}$. The largest possible value of $d$ can be written in the form $r-s\sqrt t$, where $r$, $s$, and $t$ are positive integers and $t$ is not divisible by the square of any prime. Find $r+s+t$.

Solution

See also

2009 AIME II (Problems • Answer Key • Resources)
Preceded by
2009 AIME I Problems 		Followed by
2010 AIME I 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=2009_AIME_II_Problems&oldid=221014"