Difference between revisions of "2003 AIME II Problems"
(→Problem 2) |
(→Problem 4) |
||
(14 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{AIME Problems|year=2003|n=II}} | ||
+ | |||
== Problem 1 == | == Problem 1 == | ||
The product <math>N</math> of three positive integers is 6 times their sum, and one of the integers is the sum of the other two. Find the sum of all possible values of <math>N</math>. | The product <math>N</math> of three positive integers is 6 times their sum, and one of the integers is the sum of the other two. Find the sum of all possible values of <math>N</math>. | ||
Line 5: | Line 7: | ||
== Problem 2 == | == Problem 2 == | ||
− | Let <math>N</math> be the | + | Let <math>N</math> be the greatest integer multiple of 8, whose digits are all different. What is the remainder when <math>N</math> is divided by 1000? |
[[2003 AIME II Problems/Problem 2|Solution]] | [[2003 AIME II Problems/Problem 2|Solution]] | ||
== Problem 3 == | == Problem 3 == | ||
+ | Define a <math>\text{good word}</math> as a sequence of letters that consists only of the letters <math>A</math>, <math>B</math>, and <math>C</math> - some of these letters may not appear in the sequence - and in which <math>A</math> is never immediately followed by <math>B</math>, <math>B</math> is never immediately followed by <math>C</math>, and <math>C</math> is never immediately followed by <math>A</math>. How many seven-letter good words are there? | ||
[[2003 AIME II Problems/Problem 3|Solution]] | [[2003 AIME II Problems/Problem 3|Solution]] | ||
== Problem 4 == | == Problem 4 == | ||
+ | In a regular tetrahedron, the centers of the four faces are the vertices of a smaller tetrahedron. The ratio of the volume of the smaller tetrahedron to that of the larger is <math>m/n</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>. | ||
[[2003 AIME II Problems/Problem 4|Solution]] | [[2003 AIME II Problems/Problem 4|Solution]] | ||
== Problem 5 == | == Problem 5 == | ||
+ | A cylindrical log has diameter <math>12</math> inches. A wedge is cut from the log by making two planar cuts that go entirely through the log. The first is perpendicular to the axis of the cylinder, and the plane of the second cut forms a <math>45^\circ</math> angle with the plane of the first cut. The intersection of these two planes has exactly one point in common with the log. The number of cubic inches in the wedge can be expressed as <math>n\pi</math>, where n is a positive integer. Find <math>n</math>. | ||
[[2003 AIME II Problems/Problem 5|Solution]] | [[2003 AIME II Problems/Problem 5|Solution]] | ||
== Problem 6 == | == Problem 6 == | ||
+ | In triangle <math>ABC,</math> <math>AB = 13,</math> <math>BC = 14,</math> <math>AC = 15,</math> and point <math>G</math> is the intersection of the medians. Points <math>A',</math> <math>B',</math> and <math>C',</math> are the images of <math>A,</math> <math>B,</math> and <math>C,</math> respectively, after a <math>180^\circ</math> rotation about <math>G.</math> What is the area of the union of the two regions enclosed by the triangles <math>ABC</math> and <math>A'B'C'?</math> | ||
[[2003 AIME II Problems/Problem 6|Solution]] | [[2003 AIME II Problems/Problem 6|Solution]] | ||
== Problem 7 == | == Problem 7 == | ||
+ | Find the area of rhombus <math>ABCD</math> given that the radii of the circles circumscribed around triangles <math>ABD</math> and <math>ACD</math> are <math>12.5</math> and <math>25</math>, respectively. | ||
[[2003 AIME II Problems/Problem 7|Solution]] | [[2003 AIME II Problems/Problem 7|Solution]] | ||
== Problem 8 == | == Problem 8 == | ||
+ | Find the eighth term of the sequence <math>1440,</math> <math>1716,</math> <math>1848,\ldots,</math> whose terms are formed by multiplying the corresponding terms of two arithmetic sequences. | ||
[[2003 AIME II Problems/Problem 8|Solution]] | [[2003 AIME II Problems/Problem 8|Solution]] | ||
== Problem 9 == | == Problem 9 == | ||
+ | Consider the polynomials <math>P(x) = x^{6} - x^{5} - x^{3} - x^{2} - x</math> and <math>Q(x) = x^{4} - x^{3} - x^{2} - 1.</math> Given that <math>z_{1},z_{2},z_{3},</math> and <math>z_{4}</math> are the roots of <math>Q(x) = 0,</math> find <math>P(z_{1}) + P(z_{2}) + P(z_{3}) + P(z_{4}).</math> | ||
[[2003 AIME II Problems/Problem 9|Solution]] | [[2003 AIME II Problems/Problem 9|Solution]] | ||
== Problem 10 == | == Problem 10 == | ||
+ | Two positive integers differ by <math>60.</math> The sum of their square roots is the square root of an integer that is not a perfect square. What is the maximum possible sum of the two integers? | ||
[[2003 AIME II Problems/Problem 10|Solution]] | [[2003 AIME II Problems/Problem 10|Solution]] | ||
== Problem 11 == | == Problem 11 == | ||
+ | Triangle <math>ABC</math> is a right triangle with <math>AC = 7,</math> <math>BC = 24,</math> and right angle at <math>C.</math> Point <math>M</math> is the midpoint of <math>AB,</math> and <math>D</math> is on the same side of line <math>AB</math> as <math>C</math> so that <math>AD = BD = 15.</math> Given that the area of triangle <math>CDM</math> may be expressed as <math>\frac {m\sqrt {n}}{p},</math> where <math>m,</math> <math>n,</math> and <math>p</math> are positive integers, <math>m</math> and <math>p</math> are relatively prime, and <math>n</math> is not divisible by the square of any prime, find <math>m + n + p.</math> | ||
[[2003 AIME II Problems/Problem 11|Solution]] | [[2003 AIME II Problems/Problem 11|Solution]] | ||
== Problem 12 == | == Problem 12 == | ||
+ | The members of a distinguished committee were choosing a president, and each member gave one vote to one of the <math>27</math> candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least <math>1</math> than the number of votes for that candidate. What is the smallest possible number of members of the committee? | ||
[[2003 AIME II Problems/Problem 12|Solution]] | [[2003 AIME II Problems/Problem 12|Solution]] | ||
== Problem 13 == | == Problem 13 == | ||
+ | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is <math>m/n,</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>m + n.</math> | ||
[[2003 AIME II Problems/Problem 13|Solution]] | [[2003 AIME II Problems/Problem 13|Solution]] | ||
== Problem 14 == | == Problem 14 == | ||
+ | Let <math>A = (0,0)</math> and <math>B = (b,2)</math> be points on the coordinate plane. Let <math>ABCDEF</math> be a convex equilateral hexagon such that <math>\angle FAB = 120^\circ,</math> <math>\overline{AB}\parallel \overline{DE},</math> <math>\overline{BC}\parallel \overline{EF,}</math> <math>\overline{CD}\parallel \overline{FA},</math> and the y-coordinates of its vertices are distinct elements of the set <math>\{0,2,4,6,8,10\}.</math> The area of the hexagon can be written in the form <math>m\sqrt {n},</math> where <math>m</math> and <math>n</math> are positive integers and n is not divisible by the square of any prime. Find <math>m + n.</math> | ||
[[2003 AIME II Problems/Problem 14|Solution]] | [[2003 AIME II Problems/Problem 14|Solution]] | ||
== Problem 15 == | == Problem 15 == | ||
+ | Let <cmath>P(x) = 24x^{24} + \sum_{j = 1}^{23}(24 - j)(x^{24 - j} + x^{24 + j}).</cmath> Let <math>z_{1},z_{2},\ldots,z_{r}</math> be the distinct zeros of <math>P(x),</math> and let <math>z_{k}^{2} = a_{k} + b_{k}i</math> for <math>k = 1,2,\ldots,r,</math> where <math>a_{k}</math> and <math>b_{k}</math> are real numbers. Let | ||
+ | <center><math>\sum_{k = 1}^{r}|b_{k}| = m + n\sqrt {p},</math></center> | ||
+ | where <math>m, n,</math> and <math>p</math> are integers and <math>p</math> is not divisible by the square of any prime. Find <math>m + n + p.</math> | ||
[[2003 AIME II Problems/Problem 15|Solution]] | [[2003 AIME II Problems/Problem 15|Solution]] | ||
== See also == | == See also == | ||
+ | |||
+ | {{AIME box|year = 2003|n=II|before=[[2003 AIME I Problems]]|after=[[2004 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}} |
Latest revision as of 08:02, 11 July 2023
2003 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
The product of three positive integers is 6 times their sum, and one of the integers is the sum of the other two. Find the sum of all possible values of .
Problem 2
Let be the greatest integer multiple of 8, whose digits are all different. What is the remainder when is divided by 1000?
Problem 3
Define a as a sequence of letters that consists only of the letters , , and - some of these letters may not appear in the sequence - and in which is never immediately followed by , is never immediately followed by , and is never immediately followed by . How many seven-letter good words are there?
Problem 4
In a regular tetrahedron, the centers of the four faces are the vertices of a smaller tetrahedron. The ratio of the volume of the smaller tetrahedron to that of the larger is , where and are relatively prime positive integers. Find .
Problem 5
A cylindrical log has diameter inches. A wedge is cut from the log by making two planar cuts that go entirely through the log. The first is perpendicular to the axis of the cylinder, and the plane of the second cut forms a angle with the plane of the first cut. The intersection of these two planes has exactly one point in common with the log. The number of cubic inches in the wedge can be expressed as , where n is a positive integer. Find .
Problem 6
In triangle and point is the intersection of the medians. Points and are the images of and respectively, after a rotation about What is the area of the union of the two regions enclosed by the triangles and
Problem 7
Find the area of rhombus given that the radii of the circles circumscribed around triangles and are and , respectively.
Problem 8
Find the eighth term of the sequence whose terms are formed by multiplying the corresponding terms of two arithmetic sequences.
Problem 9
Consider the polynomials and Given that and are the roots of find
Problem 10
Two positive integers differ by The sum of their square roots is the square root of an integer that is not a perfect square. What is the maximum possible sum of the two integers?
Problem 11
Triangle is a right triangle with and right angle at Point is the midpoint of and is on the same side of line as so that Given that the area of triangle may be expressed as where and are positive integers, and are relatively prime, and is not divisible by the square of any prime, find
Problem 12
The members of a distinguished committee were choosing a president, and each member gave one vote to one of the candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least than the number of votes for that candidate. What is the smallest possible number of members of the committee?
Problem 13
A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is where and are relatively prime positive integers, find
Problem 14
Let and be points on the coordinate plane. Let be a convex equilateral hexagon such that and the y-coordinates of its vertices are distinct elements of the set The area of the hexagon can be written in the form where and are positive integers and n is not divisible by the square of any prime. Find
Problem 15
Let Let be the distinct zeros of and let for where and are real numbers. Let
where and are integers and is not divisible by the square of any prime. Find
See also
2003 AIME II (Problems • Answer Key • Resources) | ||
Preceded by 2003 AIME I Problems |
Followed by 2004 AIME I 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.