A positive integer $N$ is a [i]palindrome[/i] if the integer obtained by reversing the sequence of digits of $N$ is equal to $N$. The year 1991 is the only year in the current century with the following two properties: (a) It is a palindrome (b) It factors as a product of a 2-digit prime palindrome and a 3-digit prime palindrome. How many years in the millennium between 1000 and 2000 (including the year 1991) have properties (a) and (b)? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $

A square grid of $16$ dots (see the figure) contains the corners of nine $1\times1$ squares, four $2\times 2$ squares, and one $3\times3$ square, for a total of $14$ squares whose sides are parallel to the sides of the grid. What is the smallest possible number of dots you can remove so that, after removing those dots, each of the $14$ squares is missing at least one corner? Justify your answer by showing both that the number of dots you claim is sufficient and by explaining why no smaller number of dots will work. [img]https://cdn.artofproblemsolving.com/attachments/0/9/bf091a769dbec40eceb655f5588f843d4941d6.png[/img]

Let $f(x)$ be a function which is differentiable twice and $f''(x)>0$ on $[0,\ 1]$. For a positive integer $n$, find $\lim_{n\to\infty} n\left\{\int_0^1 f(x)\ dx-\frac{1}{n}\sum_{k=0}^{n-1} f\left(\frac{k}{n}\right)\right\}.$

How many lattice points are exactly twice as close to $(0,0)$ as they are to $(15,0)$? (A lattice point is a point $(a,b)$ such that both $a$ and $b$ are integers.)

For all positive integers $n$, show that there exists a positive integer $m$ such that $n$ divides $2^{m} + m$. [i]Proposed by Juhan Aru, Estonia[/i]

Prove that, for all pairs of nonnegative integers, $j,n$, $$\sum_{K=0}^{n}k^j\binom n k \ge 2^{n-j} n^j$$

Show that there is a positive number in the Fibonacci sequence which is divisible by $ 1000$.

Let $ n \geq 2, n \in \mathbb{N}$ and let $ p, a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n \in \mathbb{R}$ satisfying $ \frac{1}{2} \leq p \leq 1,$ $ 0 \leq a_i,$ $ 0 \leq b_i \leq p,$ $ i \equal{} 1, \ldots, n,$ and \[ \sum^n_{i\equal{}1} a_i \equal{} \sum^n_{i\equal{}1} b_i.\] Prove the inequality: \[ \sum^n_{i\equal{}1} b_i \prod^n_{j \equal{} 1, j \neq i} a_j \leq \frac{p}{(n\minus{}1)^{n\minus{}1}}.\]

Let $ f$ be a function for which $ f(x/3) \equal{} x^2 \plus{} x \plus{} 1$. Find the sum of all values of $ z$ for which $ f(3z) \equal{} 7$. $ \textbf{(A)}\ \minus{} 1/3 \qquad \textbf{(B)}\ \minus{} 1/9 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 5/9 \qquad \textbf{(E)}\ 5/3$

Let $a=3^{1/223}+1$ and for all $n \ge 3$ let \[f(n)= \dbinom{n}{0} a^{n-1} - \dbinom{n}{1} a^{n-2} + \dbinom{n}{2} a^{n-3}- ... +(-1)^{n-1} \dbinom{n}{n-1} a^0.\] Find $f(2007)+f(2008).$

Prove that among the elements of the sequence $\left\{ \left\lfloor n\sqrt{2003} \right\rfloor \right\}_{n\geq 1}$ one can find a geometric progression having any number of terms, and having the ratio bigger than $k$, where $k$ can be any positive integer. [i]Radu Gologan[/i]

The sequence $a_1, a_2,..., a_{2000}$ of real numbers satisfies the condition \[a_1^3+a_2^3+...+a_n^3=(a_1+a_2+...+a_n)^2\] for all $n$, $1\leq n \leq 2000$. Prove that every element of the sequence is an integer.

$ABC$ is a triangle with a circumscribed circle $k$, center $I$ of its inscribed circle $\omega$, and center $I_a$ of its excircle $\omega _a$, opposite to $A$. $\omega$ and $\omega _a$ are tangent to $BC$ in points $P$ and $Q$, respectively, and $S$ is the middle point of the arc $\widehat{BC}$ that doesn’t contain $A$. Consider a circle that is tangent to $BC$ in point $P$ and to $k$ in point $R$. Let $RI$ intersect $k$ for a second time in point $L$. Prove that, $LI_a$ and $SQ$ intersect in a point that lies on $k$.

For how many integers $n\neq1$ does $\left(n-1\right)^3$ divide $n^{2018\left(n-1\right)}-1$? [i]2018 CCA Math Bonanza Individual Round #12[/i]

Let $n$ be a positive integer. Compute the number of words $w$ that satisfy the following three properties. 1. $w$ consists of $n$ letters from the alphabet $\{a,b,c,d\}.$ 2. $w$ contains an even number of $a$'s 3. $w$ contains an even number of $b$'s. For example, for $n=2$ there are $6$ such words: $aa, bb, cc, dd, cd, dc.$

In an acute-angled triangle $ABC$, $M$ is the midpoint of side $BC$, and $D, E$ and $F$ the feet of the altitudes from $A, B$ and $C$, respectively. Let $H$ be the orthocenter of $\Delta ABC$, $S$ the midpoint of $AH$, and $G$ the intersection of $FE$ and $AH$. If $N$ is the intersection of the median $AM$ and the circumcircle of $\Delta BCH$, prove that $\angle HMA = \angle GNS$. [i]Proposed by Marko Djikic[/i]

Let $ n$ be positive integer. For $ n \equal{} 1,\ 2,\ 3,\ \cdots n$, let denote $ S_k$ be the area of $ \triangle{AOB_k}$ such that $ \angle{AOB_k} \equal{} \frac {k}{2n}\pi ,\ OA \equal{} 1,\ OB_k \equal{} k$. Find the limit $ \lim_{n\to\infty}\frac {1}{n^2}\sum_{k \equal{} 1}^n S_k$.

Determine the greatest real number $ C $, such that for every positive integer $ n\ge 2 $, there exists $ x_1, x_2,..., x_n \in [-1,1]$, so that $$\prod_{1\le i<j\le n}(x_i-x_j) \ge C^{\frac{n(n-1)}{2}}$$.

Real numbers $ x_{1},x_{2},..,x_{n}$ are positive. Prove the inequality: $ \frac{x_{1}}{x_{2}\plus{}x_{3}}\plus{}\frac{x_{2}}{x_{3}\plus{}x_{4}}\plus{}...\plus{} \frac{x_{n\minus{}1}}{x_{n}\plus{}x_{1}}\plus{}\frac{x_{n}}{x_{1}\plus{}x_{2}}>(\sqrt{2}\minus{}1)n$

For natural number $t$, the repeating base-$t$ representation of the (base-ten) rational number $\frac{7}{51}$ is $0.\overline{23}_t=0.232323..._t$. What is $t$ ?

Right isosceles triangles are constructed on the sides of a 3-4-5 right triangle, as shown. A capital letter represents the area of each triangle. Which one of the following is true? [asy]/* AMC8 2002 #16 Problem */ draw((0,0)--(4,0)--(4,3)--cycle); draw((4,3)--(-4,4)--(0,0)); draw((-0.15,0.1)--(0,0.25)--(.15,0.1)); draw((0,0)--(4,-4)--(4,0)); draw((4,0.2)--(3.8,0.2)--(3.8,-0.2)--(4,-0.2)); draw((4,0)--(7,3)--(4,3)); draw((4,2.8)--(4.2,2.8)--(4.2,3)); label(scale(0.8)*"$Z$", (0, 3), S); label(scale(0.8)*"$Y$", (3,-2)); label(scale(0.8)*"$X$", (5.5, 2.5)); label(scale(0.8)*"$W$", (2.6,1)); label(scale(0.65)*"5", (2,2)); label(scale(0.65)*"4", (2.3,-0.4)); label(scale(0.65)*"3", (4.3,1.5));[/asy] $ \textbf{(A)}\ X\plus{}Z\equal{}W\plus{}Y \qquad \textbf{(B)}\ W\plus{}X\equal{}Z \qquad\textbf{(C)}\ 3X\plus{}4Y\equal{}5Z \qquad $ $\textbf{(D)}\ X\plus{}W\equal{}\frac{1}{2}(Y\plus{}Z) \qquad\textbf{(E)}\ X\plus{}Y\equal{}Z$

What is $o-w$, if $gun^2 = wowgun$ where $g,n,o,u,w \in \{0,1,2,\dots, 9\}$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ \text{None of above} $

Let $ l,d,k$ be natural numbers. We want to prove that for large numbers $ n$, for each $ k$-coloring of the $ n$-dimensional cube with side length $ l$, there is a $ d$-dimensional subspace that all of its vertices have the same color. Let $ H(l,d,k)$ be the least number such that for $ n\geq H(l,d,k)$ the previus statement holds. a) Prove that: \[ H(l,d \plus{} 1,k)\leq H(l,1,k) \plus{} H(l,d,k^l)^{H(l,1,k)} \] b) Prove that \[ H(l \plus{} 1,1,k \plus{} 1)\leq H(l,1 \plus{} H(l \plus{} 1,1,k),k \plus{} 1) \] c) Prove the statement of problem. d) Prove Van der Waerden's Theorem.

A positive integer is called [i]shiny[/i] if it can be written as the sum of two not necessarily distinct integers $a$ and $b$ which have the same sum of their digits. For instance, $2012$ is [i]shiny[/i], because $2012 = 2005 + 7$, and both $2005$ and $7$ have the same sum of their digits. Find all positive integers which are [b]not[/b] [i]shiny[/i] (the dark integers).

Suppose that $f(x) = \frac{x}{x^2 - 2x + 2}$ and $g(x_1, x_2, ... , x_7) = f(x_1) + f(x_2) +... + f(x_7)$. If $x_1, x_2,..., x_7$ are non-negative real numbers with sum $5$, determine for how many tuples $(x_1, x_2, ... , x_7)$ does $g(x_1, x_2, ... , x_7)$ obtain its maximal value.