GET READY FOR THE AMC 10 WITH AoPS
Learn with outstanding instructors and top-scoring students from around the world in our AMC 10 Problem Series online course.
CHECK SCHEDULE

2002 AMC 10A Problems

Revision as of 00:29, 26 December 2008 by Chenhsi (talk | contribs) (Start page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 1

Solution

Problem 2

Solution

Problem 3

Solution

Problem 4

Solution

Problem 5

Solution

Problem 6

Solution

Problem 7

Solution

Problem 8

Solution

Problem 9

Solution

Problem 10

Solution

Problem 11

Solution

Problem 12

Solution

Problem 13

Solution

Problem 14

Solution

Problem 15

Solution

Problem 16

Solution

Problem 17

Solution

Problem 18

Solution

Problem 19

Solution

Problem 20

Solution

Problem 21

Solution

Problem 22

A set of tiles numbered 1 through 100 is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with 1. How many times must the operation be performed to reduce the number of tiles in the set to one?

$\text{(A)}\ 10 \qquad \text{(B)}\ 11 \qquad \text{(C)}\ 18 \qquad \text{(D)}\ 19 \qquad \text{(E)}\ 20$

Solution

Problem 23

Solution

Problem 24

Solution

Problem 25

In trapezoid $ABCD$ with bases $AB$ and $CD$, we have $AB = 52$, $BC = 12$, $CD = 39$, and $DA = 5$. The area of $ABCD$ is

$\text{(A)}\ 182 \qquad \text{(B)}\ 195 \qquad \text{(C)}\ 210 \qquad \text{(D)}\ 234 \qquad \text{(E)}\ 260$

Solution

See also