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.
Difference between revisions of "2002 AMC 10A Problems"
(→Problem 24) |
(→Problem 16) |
||
Line 60: | Line 60: | ||
== Problem 16 == | == Problem 16 == | ||
+ | |||
+ | Let <math>\text{a + 1 = b + 2 = c + 3 = d + 4 = a + b + c + d + 5}</math>. What is <math>\text{a + b + c + d}</math>? | ||
+ | |||
+ | <math>\text{(A)}\ -5 \qquad \text{(B)}\ -7/3 \qquad \text{(C)}\ -7/3 \qquad \text{(D)}\ 5/3 \qquad \text{(E)}\ 5</math> | ||
[[2002 AMC 10A Problems/Problem 16|Solution]] | [[2002 AMC 10A Problems/Problem 16|Solution]] |
Revision as of 00:37, 26 December 2008
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
Problem 2
Problem 3
Problem 4
Problem 5
Problem 6
Problem 7
Problem 8
Problem 9
Problem 10
Problem 11
Problem 12
Problem 13
Problem 14
Problem 15
Problem 16
Let . What is ?
Problem 17
Problem 18
Problem 19
Problem 20
Problem 21
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?
Problem 23
Problem 24
Tina randomly selects two distinct numbers from the set {1, 2, 3, 4, 5}, and Sergio randomly selects a number from the set {1, 2, ..., 10}. What is the probability that Sergio's number is larger than the sum of the two numbers chosen by Tina?
Problem 25
In trapezoid with bases and , we have , , , and . The area of is