2002 AIME I Problems
2002 AIME I (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
Many states use a sequence of three letters followed by a sequence of three digits as their standard license-plate pattern. Given that each three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindrome (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is , where and are relatively prime positive integers. Find .
Problem 2
The diagram shows twenty congruent circles arranged in three rows and enclosed in a rectangle. The circles are tangent to one another and to the sides of the rectangle as shown in the diagram. The ratio of the longer dimension of the rectangle to the shorter dimension can be written as , where and are positive integers. Find .
Problem 3
Jane is 25 years old. Dick is older than Jane. In years, where is a positive integer, Dick's age and Jane's age will both be two-digit number and will have the property that Jane's age is obtained by interchanging the digits of Dick's age. Let be Dick's present age. How many ordered pairs of positive integers are possible?
Problem 4
Consider the sequence defined by for . Given that , for positive integers and with , find .
Problem 5
Let be the vertices of a regular dodecagon. How many distinct squares in the plane of the dodecagon have at least two vertices in the set ?
Problem 6
The solutions to the system of equations
are and . Find .
Problem 7
The Binomial Expansion is valid for exponents that are not integers. That is, for all real numbers , , and with ,
What are the first three digits to the right of the decimal point in the decimal representation of ?
Problem 8
Find the smallest integer k for which the conditions
(1) is a nondecreasing sequence of positive integers
(2) for all
(3)
are satisfied by more than one sequence.
Problem 9
Harold, Tanya, and Ulysses paint a very long picket fence. Harold starts with the first picket and paints every th picket; Tanya starts with the second picket and paints every th picket; and Ulysses starts with the third picket and paints every th picket. Call the positive integer when the triple of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers.
Problem 10
In the diagram below, angle is a right angle. Point is on , and bisects angle . Points and are on and , respectively, so that and . Given that and , find the integer closest to the area of quadrilateral .
Problem 11
Let and be two faces of a cube with . A beam of light emanates from vertex and reflects off face at point , which is units from and units from . The beam continues to be reflected off the faces of the cube. The length of the light path from the time it leaves point until it next reaches a vertex of the cube is given by , where and are integers and is not divisible by the square of any prime. Find .
Problem 12
Let for all complex numbers , and let for all positive integers . Given that and , where and are real numbers, find .
Problem 13
In triangle the medians and have lengths 18 and 27, respectively, and . Extend to intersect the circumcircle of at . The area of triangle is , where and are positive integers and is not divisible by the square of any prime. Find .
Problem 14
A set of distinct positive integers has the following property: for every integer in the arithmetic mean of the set of values obtained by deleting from is an integer. Given that 1 belongs to and that 2002 is the largest element of what is the greatest number of elements that can have?
Problem 15
Polyhedron has six faces. Face is a square with face is a trapezoid with parallel to and and face has The other three faces are and The distance from to face is 12. Given that where and are positive integers and is not divisible by the square of any prime, find
See also
2002 AIME I (Problems • Answer Key • Resources) | ||
Preceded by 2001 AIME II Problems |
Followed by 2002 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.