2008 AIME II Problems
Contents
Problem 1
Let , where the additions and subtractions alternate in pairs. Find the remainder when is divided by .
Problem 2
Rudolph bikes at a constant rate and stops for a five-minute break at the end of every mile. Jennifer bikes at a constant rate which is three-quarters the rate that Rudolph bikes, but Jennifer takes a five-minute break at the end of every two miles. Jennifer and Rudolph begin biking at the same time and arrive at the -mile mark at exactly the same time. How many minutes has it taken them?
Problem 3
A block of cheese in the shape of a rectangular solid measures cm by cm by cm. Ten slices are cut from the cheese. Each slice has a width of cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off?
Problem 4
There exist unique nonnegative integers and unique integers () with each either or such that Find .
Problem 5
In trapezoid with , let and . Let , , and and be the midpoints of and , respectively. Find the length .
Problem 6
The sequence is defined by The sequence is defined by Find .
Problem 7
Let , , and be the three roots of the equation Find .
Problem 8
Let . Find the smallest positive integer such that is an integer.
Problem 9
A particle is located on the coordinate plane at . Define a move for the particle as a counterclockwise rotation of radians about the origin followed by a translation of units in the positive -direction. Given that the particle's position after moves is , find the greatest integer less than of equal to .
Problem 10
This problem has not been edited in. If you know this problem, please help us out by adding it.
Problem 11
This problem has not been edited in. If you know this problem, please help us out by adding it.
Problem 12
This problem has not been edited in. If you know this problem, please help us out by adding it.
Problem 13
This problem has not been edited in. If you know this problem, please help us out by adding it.
Problem 14
This problem has not been edited in. If you know this problem, please help us out by adding it.
Problem 15
This problem has not been edited in. If you know this problem, please help us out by adding it.