Difference between revisions of "2000 AIME I Problems"
m (→Problem 9: fixed LaTeX compiling error) |
|||
(9 intermediate revisions by 4 users not shown) | |||
Line 19: | Line 19: | ||
The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. | The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. | ||
− | <center><asy>draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); | + | <center><asy>defaultpen(linewidth(0.7)); |
+ | draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); | ||
draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); | draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); | ||
draw((34,36)--(34,45)--(25,45)); | draw((34,36)--(34,45)--(25,45)); | ||
Line 29: | Line 30: | ||
== Problem 5 == | == Problem 5 == | ||
− | Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is <math>25.</math> One marble is taken out of each box randomly. The probability that both marbles are black is <math>27 | + | Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is <math>25.</math> One marble is taken out of each box randomly. The probability that both marbles are black is <math>\frac{27}{50},</math> and the probability that both marbles are white is <math>\frac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. What is <math>m + n</math>? |
[[2000 AIME I Problems/Problem 5|Solution]] | [[2000 AIME I Problems/Problem 5|Solution]] | ||
Line 60: | Line 61: | ||
== Problem 10 == | == Problem 10 == | ||
− | A sequence of numbers <math>x_{1},x_{2},x_{3},\ldots,x_{100}</math> has the property that, for every integer <math>k</math> between <math>1</math> and <math>100,</math> inclusive, the number <math>x_{k}</math> is <math>k</math> less than the sum of the other <math>99</math> numbers. Given that <math>x_{50} = m | + | A sequence of numbers <math>x_{1},x_{2},x_{3},\ldots,x_{100}</math> has the property that, for every integer <math>k</math> between <math>1</math> and <math>100,</math> inclusive, the number <math>x_{k}</math> is <math>k</math> less than the sum of the other <math>99</math> numbers. Given that <math>x_{50} = \frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>m + n</math>. |
[[2000 AIME I Problems/Problem 10|Solution]] | [[2000 AIME I Problems/Problem 10|Solution]] | ||
== Problem 11 == | == Problem 11 == | ||
− | Let <math>S</math> be the sum of all numbers of the form <math>a | + | Let <math>S</math> be the sum of all numbers of the form <math>\frac{a}{b}</math>, where <math>a</math> and <math>b</math> are relatively prime positive divisors of <math>1000.</math> What is the greatest integer that does not exceed <math>\frac{S}{10}</math>? |
[[2000 AIME I Problems/Problem 11|Solution]] | [[2000 AIME I Problems/Problem 11|Solution]] | ||
Line 77: | Line 78: | ||
== Problem 13 == | == Problem 13 == | ||
− | In the middle of a vast prairie, a firetruck is stationed at the intersection of two perpendicular straight highways. The truck travels at <math>50</math> miles per hour along the highways and at <math>14</math> miles per hour across the prairie. Consider the set of points that can be reached by the firetruck within six minutes. The area of this region is <math>m | + | In the middle of a vast prairie, a firetruck is stationed at the intersection of two perpendicular straight highways. The truck travels at <math>50</math> miles per hour along the highways and at <math>14</math> miles per hour across the prairie. Consider the set of points that can be reached by the firetruck within six minutes. The area of this region is <math>\frac{m}{n}</math> square miles, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m + n</math>. |
[[2000 AIME I Problems/Problem 13|Solution]] | [[2000 AIME I Problems/Problem 13|Solution]] | ||
== Problem 14 == | == Problem 14 == | ||
− | In triangle <math>ABC,</math> it is given that angles <math>B</math> and <math>C</math> are congruent. Points <math>P</math> and <math>Q</math> lie on <math>\overline{AC}</math> and <math>\overline{AB},</math> respectively, so that <math>AP = PQ = QB = BC.</math> Angle <math>ACB</math> is <math>r</math> times as large as angle <math>APQ,</math> where <math>r</math> is a positive real number. Find | + | In triangle <math>ABC,</math> it is given that angles <math>B</math> and <math>C</math> are congruent. Points <math>P</math> and <math>Q</math> lie on <math>\overline{AC}</math> and <math>\overline{AB},</math> respectively, so that <math>AP = PQ = QB = BC.</math> Angle <math>ACB</math> is <math>r</math> times as large as angle <math>APQ,</math> where <math>r</math> is a positive real number. Find <math>\lfloor 1000r \rfloor</math>. |
[[2000 AIME I Problems/Problem 14|Solution]] | [[2000 AIME I Problems/Problem 14|Solution]] | ||
== Problem 15 == | == Problem 15 == | ||
− | A stack of <math>2000</math> cards is labelled with the integers from <math>1</math> to <math>2000,</math> with different integers on different cards. The cards in the stack are not in numerical order. The top card is removed from the stack and placed on the table, and the next card is moved to the bottom of the stack. The new top card is removed from the stack and placed on the table, to the right of the card already there, and the next card in the stack is moved to the bottom of the stack. The process - placing the top card to the right of the cards already on the table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on the table. It is found that, reading from left to right, the labels on the cards are now in ascending order: <math>1,2,3,\ldots,1999,2000.</math> In the original stack of cards, how many cards were above the card labeled 1999? | + | A stack of <math>2000</math> cards is labelled with the integers from <math>1</math> to <math>2000,</math> with different integers on different cards. The cards in the stack are not in numerical order. The top card is removed from the stack and placed on the table, and the next card is moved to the bottom of the stack. The new top card is removed from the stack and placed on the table, to the right of the card already there, and the next card in the stack is moved to the bottom of the stack. The process - placing the top card to the right of the cards already on the table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on the table. It is found that, reading from left to right, the labels on the cards are now in ascending order: <math>1,2,3,\ldots,1999,2000.</math> In the original stack of cards, how many cards were above the card labeled <math>1999</math>? |
[[2000 AIME I Problems/Problem 15|Solution]] | [[2000 AIME I Problems/Problem 15|Solution]] | ||
== See also == | == See also == | ||
+ | |||
+ | {{AIME box|year = 2000|n=I|before=[[1999 AIME Problems]]|after=[[2000 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}} | {{MAA Notice}} |
Latest revision as of 20:04, 14 September 2020
2000 AIME I (Answer Key) | AoPS Contest Collections | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
Find the least positive integer such that no matter how is expressed as the product of any two positive integers, at least one of these two integers contains the digit .
Problem 2
Let and be integers satisfying . Let , let be the reflection of across the line , let be the reflection of across the y-axis, let be the reflection of across the x-axis, and let be the reflection of across the y-axis. The area of pentagon is . Find .
Problem 3
In the expansion of where and are relatively prime positive integers, the coefficients of and are equal. Find .
Problem 4
The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle.
Problem 5
Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is One marble is taken out of each box randomly. The probability that both marbles are black is and the probability that both marbles are white is where and are relatively prime positive integers. What is ?
Problem 6
For how many ordered pairs of integers is it true that and that the arithmetic mean of and is exactly more than the geometric mean of and ?
Problem 7
Suppose that and are three positive numbers that satisfy the equations and Then where and are relatively prime positive integers. Find .
Problem 8
A container in the shape of a right circular cone is 12 inches tall and its base has a 5-inch radius. The liquid that is sealed inside is 9 inches deep when the cone is held with its point down and its base horizontal. When the liquid is held with its point up and its base horizontal, the height of the liquid is where and are positive integers and is not divisible by the cube of any prime number. Find .
Problem 9
The system of equations
has two solutions and . Find .
Problem 10
A sequence of numbers has the property that, for every integer between and inclusive, the number is less than the sum of the other numbers. Given that , where and are relatively prime positive integers, find .
Problem 11
Let be the sum of all numbers of the form , where and are relatively prime positive divisors of What is the greatest integer that does not exceed ?
Problem 12
Given a function for which
holds for all real what is the largest number of different values that can appear in the list ?
Problem 13
In the middle of a vast prairie, a firetruck is stationed at the intersection of two perpendicular straight highways. The truck travels at miles per hour along the highways and at miles per hour across the prairie. Consider the set of points that can be reached by the firetruck within six minutes. The area of this region is square miles, where and are relatively prime positive integers. Find .
Problem 14
In triangle it is given that angles and are congruent. Points and lie on and respectively, so that Angle is times as large as angle where is a positive real number. Find .
Problem 15
A stack of cards is labelled with the integers from to with different integers on different cards. The cards in the stack are not in numerical order. The top card is removed from the stack and placed on the table, and the next card is moved to the bottom of the stack. The new top card is removed from the stack and placed on the table, to the right of the card already there, and the next card in the stack is moved to the bottom of the stack. The process - placing the top card to the right of the cards already on the table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on the table. It is found that, reading from left to right, the labels on the cards are now in ascending order: In the original stack of cards, how many cards were above the card labeled ?
See also
2000 AIME I (Problems • Answer Key • Resources) | ||
Preceded by 1999 AIME Problems |
Followed by 2000 AIME II Problems | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
- 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.