Difference between revisions of "2008 AIME II Problems"

Line 50: Line 50:
  
 
== Problem 8 ==
 
== Problem 8 ==
{{problem}}
+
Let <math>a = pi/2008</math>. Find the smallest possible integer <math>n</math> such that <math>2[cos(a)sin(a) + cos(4a)sin(2a) + cos(9a)sin(3a) + /cdots + cos(n^2a)sin(na)]</math> is an integer.
  
 
[[2008_AIME_II_Problems/Problem_8|Solution]]
 
[[2008_AIME_II_Problems/Problem_8|Solution]]

Revision as of 19:04, 3 April 2008

Problem 1

Let $N = 100^2 + 99^2 - 98^2 - 97^2 + 96^2 + \cdots + 4^2 + 3^2 - 2^2 - 1^2$, where the additions and subtractions alternate in pairs. Find the remainder when $N$ is divided by $1000$.

Solution

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 $50$-mile mark at exactly the same time. How many minutes has it taken them?

Solution

Problem 3

A block of cheese in the shape of a rectangular solid measures $10$ cm by $13$ cm by $14$ cm. Ten slices are cut from the cheese. Each slice has a width of $1$ 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?

Solution

Problem 4

There exist $r$ unique nonnegative integers $n_1 > n_2 > \cdots > n_r$ and $r$ unique integers $a_k$ ($1\le k\le r$) with each $a_k$ either $1$ or $- 1$ such that \[a_13^{n_1} + a_23^{n_2} + \cdots + a_r3^{n_r} = 2008.\] Find $n_1 + n_2 + \cdots + n_r$.

Solution

Problem 5

In trapezoid $ABCD$ with $\overline{BC}\parallel\overline{AD}$, let $BC = 1000$ and $AD = 2008$. Let $\angle A = 37^\circ$, $\angle D = 53^\circ$, and $M$ and $N$ be the midpoints of $\overline{BC}$ and $\overline{AD}$, respectively. Find the length $MN$.

Solution

Problem 6

The sequence $\{a_n\}$ is defined by \[a_0 = 1,a_1 = 1, \text{ and } a_n = a_{n - 1} + \frac {a_{n - 1}^2}{a_{n - 2}}\text{ for }n\ge2.\] The sequence $\{b_n\}$ is defined by \[b_0 = 1,b_1 = 3, \text{ and } b_n = b_{n - 1} + \frac {b_{n - 1}^2}{b_{n - 2}}\text{ for }n\ge2.\] Find $\frac {b_{32}}{a_{32}}$.

Solution

Problem 7

Let $r$, $s$, and $t$ be the three roots of the equation \[8x^3 + 1001x + 2008 = 0.\] Find $(r + s)^3 + (s + t)^3 + (t + r)^3$.

Solution

Problem 8

Let $a = pi/2008$. Find the smallest possible integer $n$ such that $2[cos(a)sin(a) + cos(4a)sin(2a) + cos(9a)sin(3a) + /cdots + cos(n^2a)sin(na)]$ is an integer.

Solution

Problem 9

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 10

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 11

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 12

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 13

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 14

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

Problem 15

This problem has not been edited in. If you know this problem, please help us out by adding it.

Solution

See also

Invalid username
Login to AoPS