Difference between revisions of "2004 AIME II Problems"
m (→Problem 6) |
(→Problem 12) |
||
Line 57: | Line 57: | ||
== Problem 12 == | == Problem 12 == | ||
− | Let <math> ABCD </math> be an isosceles trapezoid, whose dimensions are <math> AB = 6, BC=5=DA, </math>and <math> CD=4. </math> Draw circles of radius 3 centered at <math> A </math> and <math> B | + | Let <math> ABCD </math> be an isosceles trapezoid, whose dimensions are <math> AB = 6, BC=5=DA, </math>and <math> CD=4. </math> Draw circles of radius 3 centered at <math> A </math> and <math>B</math> and circles of radius 2 centered at <math> C </math> and <math> D. </math> A circle contained within the trapezoid is tangent to all four of these circles. Its radius is <math> \frac{-k+m\sqrt{n}}p, </math> where <math> k, m, n, </math> and <math> p </math> are positive integers, <math> n </math> is not divisible by the square of any prime, and <math> k </math> and <math> p </math> are relatively prime. Find <math> k+m+n+p. </math> |
[[2004 AIME II Problems/Problem 12|Solution]] | [[2004 AIME II Problems/Problem 12|Solution]] |
Revision as of 20:41, 17 June 2018
2004 AIME II (Answer Key) | AoPS Contest Collections • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
A chord of a circle is perpendicular to a radius at the midpoint of the radius. The ratio of the area of the larger of the two regions into which the chord divides the circle to the smaller can be expressed in the form where and are positive integers, and are relatively prime, and neither nor is divisible by the square of any prime. Find the remainder when the product is divided by 1000.
Problem 2
A jar has 10 red candies and 10 blue candies. Terry picks two candies at random, then Mary picks two of the remaining candies at random. Given that the probability that they get the same color combination, irrespective of order, is where and are relatively prime positive integers, find
Problem 3
A solid rectangular block is formed by gluing together congruent 1-cm cubes face to face. When the block is viewed so that three of its faces are visible, exactly 231 of the 1-cm cubes cannot be seen. Find the smallest possible value of
Problem 4
How many positive integers less than 10,000 have at most two different digits?
Problem 5
In order to complete a large job, 1000 workers were hired, just enough to complete the job on schedule. All the workers stayed on the job while the first quarter of the work was done, so the first quarter of the work was completed on schedule. Then 100 workers were laid off, so the second quarter of the work was completed behind schedule. Then an additional 100 workers were laid off, so the third quarter of the work was completed still further behind schedule. Given that all workers work at the same rate, what is the minimum number of additional workers, beyond the 800 workers still on the job at the end of the third quarter, that must be hired after three-quarters of the work has been completed so that the entire project can be completed on schedule or before?
Problem 6
Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio what is the least possible total for the number of bananas?
Problem 7
is a rectangular sheet of paper that has been folded so that corner is matched with point on edge The crease is where is on and is on The dimensions and are given. The perimeter of rectangle is where and are relatively prime positive integers. Find
Problem 8
How many positive integer divisors of are divisible by exactly 2004 positive integers?
Problem 9
A sequence of positive integers with and is formed so that the first three terms are in geometric progression, the second, third, and fourth terms are in arithmetic progression, and, in general, for all the terms are in geometric progression, and the terms and are in arithmetic progression. Let be the greatest term in this sequence that is less than 1000. Find
Problem 10
Let be the set of integers between 1 and whose binary expansions have exactly two 1's. If a number is chosen at random from the probability that it is divisible by 9 is where and are relatively prime positive integers. Find
Problem 11
A right circular cone has a base with radius 600 and height A fly starts at a point on the surface of the cone whose distance from the vertex of the cone is 125, and crawls along the surface of the cone to a point on the exact opposite side of the cone whose distance from the vertex is Find the least distance that the fly could have crawled.
Problem 12
Let be an isosceles trapezoid, whose dimensions are and Draw circles of radius 3 centered at and and circles of radius 2 centered at and A circle contained within the trapezoid is tangent to all four of these circles. Its radius is where and are positive integers, is not divisible by the square of any prime, and and are relatively prime. Find
Problem 13
Let be a convex pentagon with and Given that the ratio between the area of triangle and the area of triangle is where and are relatively prime positive integers, find
Problem 14
Consider a string of 's, into which signs are inserted to produce an arithmetic expression. For example, could be obtained from eight 's in this way. For how many values of is it possible to insert signs so that the resulting expression has value ?
Problem 15
A long thin strip of paper is 1024 units in length, 1 unit in width, and is divided into 1024 unit squares. The paper is folded in half repeatedly. For the first fold, the right end of the paper is folded over to coincide with and lie on top of the left end. The result is a 512 by 1 strip of double thickness. Next, the right end of this strip is folded over to coincide with and lie on top of the left end, resulting in a 256 by 1 strip of quadruple thickness. This process is repeated 8 more times. After the last fold, the strip has become a stack of 1024 unit squares. How many of these squares lie below the square that was originally the 942nd square counting from the left?
See also
- American Invitational Mathematics Examination
- AIME Problems and Solutions
- Mathematics competition resources
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.