An arithmetic sequence has first term $a$ and common difference $d$. If the sum of the first ten terms is half the sum of the next ten terms, what is the ratio
$\frac{a}{d}$ ? Express your answer as a common fraction.
Consider the polynomial
\[P(x)=\prod_{k=0}^{10}(x^{2^k}+2^k)=(x+1)(x^2+2)(x^4+4)\cdots (x^{1024}+1024)\]
The coefficient of $x^{2012}$ is equal to $2^a$. What is $a$?
Let $\{a_k\}_{k=1}^{2011}$ be the sequence of real numbers defined by $a_1=0.201,$ $a_2=(0.2011)^{a_1},$ $a_3=(0.20101)^{a_2},$ $a_4=(0.201011)^{a_3}$, and in general,
\[a_k=\begin{cases}(0.\underbrace{20101\cdots 0101}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is odd,}\\(0.\underbrace{20101\cdots 01011}_{k+2\text{ digits}})^{a_{k-1}}\qquad\text{if }k\text{ is even.}\end{cases}\]
Rearranging the numbers in the sequence $\{a_k\}_{k=1}^{2011}$ in decreasing order produces a new sequence $\{b_k\}_{k=1}^{2011}$. What is the sum of all integers $k$, $1\le k \le 2011$, such that $a_k=b_k?$
Let $f(x)=|2\{x\}-1|$ where $\{x\}$ denotes the fractional part of $x$. The number $n$ is the smallest positive integer such that the equation \[nf(xf(x))=x\] has at least $2012$ real solutions. What is $n$? Note: the fractional part of $x$ is a real number $y=\{x\}$ such that $0\le y<1$ and $x-y$ is an integer.
Let $(a_1,a_2, \dots ,a_{10})$ be a list of the first 10 positive integers such that for each $2 \le i \le 10$ either $a_i+1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}\cdots p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m\ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1\le N\le 400$ is the sequence $(f_1(N),f_2(N),f_3(N),\dots )$ unbounded?
Note: A sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$.
The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
In the eight term sequence $A$, $B$, $C$, $D$, $E$, $F$, $G$, $H$, the value of $C$ is $5$ and the sum of any three consecutive terms is $30$. What is $A+H$?
Suppose that $\left|x+y\right|+\left|x-y\right|=2$. What is the maximum possible value of $x^2-6x+y^2$?
At a competition with $N$ players, the number of players given elite status is equal to $2^{1+\lfloor \log_{2} (N-1) \rfloor}-N$. Suppose that $19$ players are given elite status. What is the sum of the two smallest possible values of $N$?
Let $f(x)=ax^2+bx+c$, where $a$, $b$, and $c$ are integers. Suppose that $f(1)=0$, $50 < f(7) < 60$, $70 < f(8) < 80$, $5000k < f(100) < 5000(k+1)$ for some integer $k$. What is $k$?
Let $f_{1}(x)=\sqrt{1-x}$, and for integers $n \geq 2$, let $f_{n}(x)=f_{n-1}(\sqrt{n^2 - x})$. If $N$ is the largest value of $n$ for which the domain of $f_{n}$ is nonempty, the domain of $f_{N}$ is $[c]$. What is $N+c$?
Let $f(x) = 10^{10x}, g(x) = \log_{10}\left(\frac{x}{10}\right), h_1(x) = g(f(x))$, and $h_n(x) = h_1(h_{n-1}(x))$ for integers $n \geq 2$. What is the sum of the digits of $h_{2011}(1)$?
The arithmetic mean of two distinct positive integers $x$ and $y$ is a two-digit integer. The geometric mean of $x$ and $y$ is obtained by reversing the digits of the arithmetic mean. What is $|x - y|$?
Let $T_1$ be a triangle with sides $2011$, $2012$, and $2013$. For $n \geq 1$, if $T_n = \Delta ABC$ and $D, E$, and $F$ are the points of tangency of the incircle of $\Delta ABC$ to the sides $AB$, $BC$, and $AC$, respectively, then $T_{n+1}$ is a triangle with side lengths $AD, BE$, and $CF$, if it exists. What is the perimeter of the last triangle in the sequence $\left(T_n\right)$?
For every $m$ and $k$ integers with $k$ odd, denote by $\left[\frac{m}{k}\right]$ the integer closest to $\frac{m}{k}$. For every odd integer $k$, let $P(k)$ be the probability that
\[\left[\frac{n}{k}\right] + \left[\frac{100 - n}{k}\right] = \left[\frac{100}{k}\right]\]
for an integer $n$ randomly chosen from the interval $1 \leq n \leq 99!$. What is the minimum possible value of $P(k)$ over the odd integers $k$ in the interval $1 \leq k \leq 99$?
If $x<0$, then which of the following must be positive?
The first four terms of an arithmetic sequence are $p$, $9$, $3p-q$, and $3p+q$. What is the $2010^\text{th}$ term of this sequence?
The solution of the equation $7^{x+7} = 8^x$ can be expressed in the form $x = \log_b 7^7$. What is $b$?
Arithmetic sequences $\left(a_n\right)$ and $\left(b_n\right)$ have integer terms with $a_1=b_1=1 < a_2 \le b_2$ and $a_n b_n = 2010$ for some $n$. What is the largest possible value of $n$?
The graph of $y=x^6-10x^5+29x^4-4x^3+ax^2$ lies above the line $y=bx+c$ except at three values of $x$, where the graph and the line intersect. What is the largest of these values?
What is the minimum value of $\left|x-1\right| + \left|2x-1\right| + \left|3x-1\right| + \cdots + \left|119x - 1 \right|$?
Let $f(x) = \log_{10} \left(\sin(\pi x) \cdot \sin(2 \pi x) \cdot \sin (3 \pi x) \cdots \sin(8 \pi x)\right)$. The intersection of the domain of $f(x)$ with the interval $[0,1]$ is a union of $n$ disjoint open intervals. What is $n$?
At the beginning of the school year, $50\%$ of all students in Mr. Wells' math class answered "Yes" to the question "Do you love math", and $50\%$ answered "No." At the end of the school year, $70\%$ answered "Yes" and $30\%$ answered "No." Altogether, $x\%$ of the students gave a different answer at the beginning and end of the school year. What is the difference between the maximum and the minimum possible values of $x$?
For what value of $x$ does
\[\log_{\sqrt{2}}\sqrt{x}+\log_{2}{x}+\log_{4}{x^2}+\log_{8}{x^3}+\log_{16}{x^4}=40?\]