Difference between revisions of "Mock AIME 1 2010 Problems"

Revision as of 00:29, 25 November 2016

Problem 1

Let $a_k = 7k + 4$ . Find the number of perfect squares among $\{a_1, a_2, \ldots, a_{2010}\}$ .

Problem 2

Find the last three digits of the number of 7-tuples of positive integers $(a_1, a_2, a_3, a_4, a_5, a_6, a_7)$ such that $a_1 \, | \, a_2 \, | \, a_3 \, | \, a_4 \, | \, a_5 \, | \, a_6 \, | \, a_7 \, | \, 6468$ , that is, $a_1$ divides $a_2$ , $a_2$ divides $a_3$ , $a_3$ divides $a_4$ , $a_4$ divides $a_5$ , $a_5$ divides $a_6$ , $a_6$ divides $a_7$ , and $a_7$ divides 6468.

Problem 3

Let $AB$ be a line segment of length $20 \sqrt{2}$ , and let $S$ be the set of all points $P$ such that $m \angle APB \geq 45^{\circ}$ . Find the last three digits of the largest integer less than the area of $S$ .

Problem 4

A round robin tournament is a tournament in which every player plays every other player exactly once. There is a round robin tournament with 2010 people. In each match, the winner scores one point, and the loser scores no points. There are no ties. Find the last three digits of the greatest possible difference between the first and second highest scores appearing among the players.

Problem 5

For every integer $N$ , the $\emph{balanced ternary}$ representation of $N$ is defined to be the unique sequence of integers $(b_0, b_1, \ldots, b_m)$ , with $b_i \in \{-1, 0, 1\}$ and $b_m \neq 0$ such that $N = \sum_{i=0}^{m} b_i 3^i$ . We represent $N$ as $c_0 c_1 \ldots c_m$ , where $c_i = b_i$ if $b_i$ is 0 or 1, and $c_i = \underline{1}$ if $b_i = -1$ . For example, $2010 = 3^7 - 3^5 + 3^4 - 3^3 + 3^2 + 3 = 10\underline{1}1\underline{1}110$ . Find the last three digits of the sum of all integers $N$ with $1 \leq N \leq 81$ such that $N$ has at least one zero when written in balanced ternary form.

Problem 6

Find the number of Gaussian integers $z$ with magnitude less than 10000 such that there exists a different Gaussian integer $w$ such that $z = w^4$ . (The magnitude of a complex $a+bi$ , where $a$ and $b$ are reals, is defined to be $\sqrt{a^2+b^2}$ . A Gaussian integer is defined to be a complex number whose real and imaginary parts are both integers.)

Problem 7

Find the number of positive integers $n \leq 2010$ for which there exists a positive integer $x$ such that $\frac{n + x}{x}$ is the square of an integer.

Problem 8

In the context of this problem, a $\emph{square}$ is a $1 \times 1$ block, a $\emph{domino}$ is a $1 \times 2$ block, and a $\emph{triomino}$ is a $1 \times 3$ block. If $N$ is the number of ways George can place one square, two identical dominoes, and three identical trominoes on a $1 \times 20$ chessboard such that no two overlap, find the remainder when $N$ is divided by 1000.

Solution

Problem 9

Let $\omega_1$ and $\omega_2$ be circles of radii 5 and 7, respectively, and suppose that the distance between their centers is 10. There exists a circle $\omega_3$ that is internally tangent to both $\omega_1$ and $\omega_2$ , and tangent to the line joining the centers of $\omega_1$ and $\omega_2$ . If the radius of $\omega_3$ can be expressed in the form $a \sqrt{b} - c$ , where $a$ , $b$ , and $c$ are integers, and $b$ is not divisible by the square if any prime, find the value of $a + b + c$ .

Problem 10

Find the last three digits of the largest possible value of $\frac{a^2 b^6}{a^{2 \log_2 a} (a^2 b)^{\log_2 b}},$ where $a$ and $b$ are positive reals.

Problem 11

Let $\triangle ABC$ be such that $AB = 7$ , $BC = 8$ , and $CA = 9$ . Let $D$ , $E$ , and $F$ be points such that $DB \perp BA$ , $DC \perp CA$ , $EC \perp CB$ , $EA \perp AB$ , $FA \perp AC$ , and $FB \perp BC$ . If the perimeter of hexagon $AFBDCE$ can be expressed in the form $\frac{a \sqrt{b}}{c}$ , where $a$ and $c$ are relatively prime positive integers and $b$ is an integer not divisible by the square of any prime, find $a$ .

Problem 12

Suppose $a_1 = 32$ , $a_2 = 24$ , and $a_{n+1} = a_n^{13} a_{n-1}^{37}$ for all integers $n \geq 2$ . Find the last three digits of $a_{2010}$ .

Problem 13

Suppose $\triangle ABC$ is inscribed in circle $\Gamma$ . $B_1$ and $C_1$ are the feet of the altitude from $B$ to $CA$ and $C$ to $AB$ , respectively. Let $D$ be the intersection of lines $\overline{B_1 C_1}$ and $\overline{BC}$ , let $E$ be the point of intersection of $\Gamma$ and line $\overline{DA}$ distinct from $A$ , and let $F$ be the foot of the perpendicular from $E$ to $BD$ . Given that $BD = 28$ , $EF = \frac{20 \sqrt{159}}{7}$ , and $ED^2 + EB^2 = 3050$ , and that $\tan m \angle ACB$ can be expressed in the form $\frac{a \sqrt{b}}{c}$ , where $a$ and $c$ are relatively prime positive integers and $b$ is an integer not divisible by the square of any prime, find the last three digits of $a + b + c$ .

Problem 14

Let $S_n={1,2,\ldots,n}$ , and let $A=\{a_1,a_2,\ldots,a_k\}$ be a subset of $S_n$ with $k > 1$ and $a_1 < a_2 < \cdots < a_k$ . For such a set $A$ , let $f(A,n)$ denote the number of sets $B=\{b_1,b_2,\ldots,b_k\}$ with $b_1 < b_2 < \cdots < b_k$ such that

(i) $B$ is a subset of $S_n$ with the same number of elements as $A$ ,

(ii) $|a_i-b_i| < |b_i-a_{i+1}|$ for $1 \le i \le k-1$ ,

(iii) $|a_{i+1}-b_{i+1}| < |b_i-a_{i+1}|$ for $1 \le i \le k-1$ .

Let $g(n)=\max_{A\subseteq S_n} f(A,n)$ . What is the smallest positive integer $n$ such that $g(n)$ is over 9000?

Problem 15

Let $X$ be the set of all integers less than or equal to 2010 such that when its divisors are listed in increasing order, they are alternatingly odd and even. For example, 6 belongs to $X$ , since the divisors of 6 are 1, 2, 3, and 6, which are odd, even, odd, and even in that order. Find the last three digits of the largest possible value of $n \tau(n)$ , where $n$ lies in $X$ and $\tau(n)$ denotes the number of divisors of $n$ .

@@ Line 3: / Line 3: @@
 == Problem 2 ==
-Find the last three digits of the number of 7-tuples of positive integers <math>(a_1, a_2, a_3, a_4, a_5, a_6, a_7)</math> such that \linebreak<cmath>0</cmath> <math>a_1 \, | \, a_2 \, | \, a_3 \, | \, a_4 \, | \, a_5 \, | \, a_6 \, | \, a_7 \, | \, 6468</math>, that is, <math>a_1</math> divides <math>a_2</math>, <math>a_2</math> divides <math>a_3</math>, <math>a_3</math> divides <math>a_4</math>, <math>a_4</math> divides <math>a_5</math>, <math>a_5</math> divides <math>a_6</math>, <math>a_6</math> divides <math>a_7</math>, and <math>a_7</math> divides 6468.
+Find the last three digits of the number of 7-tuples of positive integers <math>(a_1, a_2, a_3, a_4, a_5, a_6, a_7)</math> such that <math>a_1 \, | \, a_2 \, | \, a_3 \, | \, a_4 \, | \, a_5 \, | \, a_6 \, | \, a_7 \, | \, 6468</math>, that is, <math>a_1</math> divides <math>a_2</math>, <math>a_2</math> divides <math>a_3</math>, <math>a_3</math> divides <math>a_4</math>, <math>a_4</math> divides <math>a_5</math>, <math>a_5</math> divides <math>a_6</math>, <math>a_6</math> divides <math>a_7</math>, and <math>a_7</math> divides 6468.
 == Problem 3 ==
@@ Line 12: / Line 12: @@
 == Problem 5 ==
-For every integer <math>N</math>, the <math>\emph{balanced ternary}</math> representation of <math>N</math> is defined to be the unique sequence of integers \linebreak<cmath>0</cmath> <math>(b_0, b_1, \ldots, b_m)</math>, with <math>b_i \in \{-1, 0, 1\}</math> and <math>b_m \neq 0</math> such that <math>N = \sum_{i=0}^{m} b_i 3^i</math>. We represent <math>N</math> as <math>c_0 c_1 \ldots c_m</math>, where <math>c_i = b_i</math> if <math>b_i</math> is 0 or 1, and <math>c_i = \underline{1}</math> if <math>b_i = -1</math>. For example, <math>2010 = 3^7 - 3^5 + 3^4 - 3^3 + 3^2 + 3 = 10\underline{1}1\underline{1}110</math>. Find the last three digits of the sum of all integers <math>N</math> with <math>1 \leq N \leq 81</math> such that <math>N</math> has at least one zero when written in balanced ternary form.
+For every integer <math>N</math>, the <math>\emph{balanced ternary}</math> representation of <math>N</math> is defined to be the unique sequence of integers <math>(b_0, b_1, \ldots, b_m)</math>, with <math>b_i \in \{-1, 0, 1\}</math> and <math>b_m \neq 0</math> such that <math>N = \sum_{i=0}^{m} b_i 3^i</math>. We represent <math>N</math> as <math>c_0 c_1 \ldots c_m</math>, where <math>c_i = b_i</math> if <math>b_i</math> is 0 or 1, and <math>c_i = \underline{1}</math> if <math>b_i = -1</math>. For example, <math>2010 = 3^7 - 3^5 + 3^4 - 3^3 + 3^2 + 3 = 10\underline{1}1\underline{1}110</math>. Find the last three digits of the sum of all integers <math>N</math> with <math>1 \leq N \leq 81</math> such that <math>N</math> has at least one zero when written in balanced ternary form.
 == Problem 6 ==
@@ Line 29: / Line 29: @@
 == Problem 10 ==
-Find the last three digits of the largest possible value of
+Find the last three digits of the largest possible value of <cmath>\frac{a^2 b^6}{a^{2 \log_2 a} (a^2 b)^{\log_2 b}},</cmath> where <math>a</math> and <math>b</math> are positive reals.
-<math>\frac{a^2 b^6}{a^{2 \log_2 a} (a^2 b)^{\log_2 b}},</math>
-where <math>a</math> and <math>b</math> are positive reals.
 == Problem 11 ==
@@ Line 44: / Line 42: @@
 == Problem 14 ==
 Let <math>S_n={1,2,\ldots,n}</math>, and let <math>A=\{a_1,a_2,\ldots,a_k\}</math> be a subset of <math>S_n</math> with <math>k > 1</math> and <math>a_1 < a_2 < \cdots < a_k</math>. For such a set <math>A</math>, let <math>f(A,n)</math> denote the number of sets <math>B=\{b_1,b_2,\ldots,b_k\}</math> with <math>b_1 < b_2 < \cdots < b_k</math> such that
-\begin{enumerate}
-\item
+(i) <math>B</math> is a subset of <math>S_n</math> with the same number of elements as <math>A</math>,
-<cmath>(i)</cmath> <math>B</math> is a subset of <math>S_n</math> with the same number of elements as <math>A</math>,
-\item
+(ii) <math>|a_i-b_i| < |b_i-a_{i+1}|</math> for <math>1 \le i \le k-1</math>,
-<cmath>(ii)</cmath> <math>|a_i-b_i| < |b_i-a_{i+1}|</math> for <math>1 \le i \le k-1</math>,
-\item
+(iii) <math>|a_{i+1}-b_{i+1}| < |b_i-a_{i+1}|</math> for <math>1 \le i \le k-1</math>.
-<cmath>(iii)</cmath> <math>|a_{i+1}-b_{i+1}| < |b_i-a_{i+1}|</math> for <math>1 \le i \le k-1</math>.
-\end{enumerate}
 Let <math>g(n)=\max_{A\subseteq S_n} f(A,n)</math>. What is the smallest positive integer <math>n</math> such that <math>g(n)</math> is over 9000?
 == Problem 15 ==
 Let <math>X</math> be the set of all integers less than or equal to 2010 such that when its divisors are listed in increasing order, they are alternatingly odd and even. For example, 6 belongs to <math>X</math>, since the divisors of 6 are 1, 2, 3, and 6, which are odd, even, odd, and even in that order. Find the last three digits of the largest possible value of <math>n \tau(n)</math>, where <math>n</math> lies in <math>X</math> and <math>\tau(n)</math> denotes the number of divisors of <math>n</math>.

Page

Toolbox

Search