2006 AMC 12A Problems
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
Sandwiches at Joe's Fast Food cost each and sodas cost each. How many dollars will it cost to purchase sandwiches and sodas?
Problem 2
Define . What is ?
Problem 3
The ratio of Mary's age to Alice's age is . Alice is years old. How old is Mary?
Problem 4
A digital watch displays hours and minutes with AM and PM. What is the largest possible sum of the digits in the display?
Problem 5
Doug and Dave shared a pizza with equally-sized slices. Doug wanted a plain pizza, but Dave wanted anchovies on half the pizza. The cost of a plain pizza was , and there was an additional cost of for putting anchovies on one half. Dave ate all the slices of anchovy pizza and one plain slice. Doug ate the remainder. Each paid for what he had eaten. How many more dollars did Dave pay than Doug?
Problem 6
(Missing Diagram)
The rectangle is cut into two congruent hexagons, as shown, in such a way that the two hexagons can be repositioned without overlap to form a square. What is ?
Problem 7
Mary is $20%$ (Error compiling LaTeX. Unknown error_msg) older than Sally, and Sally is $40%$ (Error compiling LaTeX. Unknown error_msg) younger than Danielle. The sum of their ages is years. How old will Mary be on her next birthday?
Problem 8
How many sets of two or more consecutive positive integers have a sum of ?
Problem 9
Oscar buys pencils and erasers for . A pencil costs more than an eraser, and both items cost a whole number of cents. What is the total cost, in cents, of one pencil and one eraser?
Problem 10
For how many real values of is an integer?
Problem 11
Which of the following describes the graph of the equation ?
Problem 12
(Missing Diagram)
A number of linked rings, each 1 cm thick, are hanging on a peg. The top ring has an outisde diameter of 20 cm. The outside diameter of each of the outer rings is 1 cm less than that of the ring above it. The bottom ring has an outside diameter of 3 cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring?
Problem 13
(Missing Diagram)
The vertices of a right triangle are the centers of three mutually externally tangent circles, as shown. What is the sum of the areas of the three circles?
Problem 14
Two farmers agree that pigs are worth and that goats are worth . When one farmer owes the other money, he pays the debt in pigs or goats, with "change" received in the form of goats or pigs as necessary. (For example, a debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?
Problem 15
Suppose and . What is the smallest possible positive value of ?
Problem 16
(Missing Diagram)
Circles with centers and have radii and , respectively. A common internal tangent intersects the circles at and , respectively. Lines and intersect at , and . What is ?
Problem 17
(Missing Diagram)
Square has side length , a circle centered at has radius , and and are both rational. The circle passes through , and lies on . Point lies on the circle, on the same side of as . Segment is tangent to the circle, and . What is ?
Problem 18
The function has the property that for each real number in its domain, is also in its domain and
What is the largest set of real numbers that can be in the domain of ?
Problem 19
(Missing Diagram)
Circles with centers and have radii and , respectively. The equation of a common external tangent to the circles can be written in the form with . What is ?
Problem 20
A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once?