Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

Let $f:\mathbb{R} \to \mathbb{R}$ a continuos function and $\alpha$ a real number such that $$\lim_{x\to\infty}f(x) = \lim_{x\to-\infty}f(x) = \alpha.$$ Prove that for any $r > 0,$ there exists $x,y \in \mathbb{R}$ such that $y-x = r$ and $f(x) = f(y).$

Find the smallest positive integer $n$ that satisfies the following: We can color each positive integer with one of $n$ colors such that the equation $w + 6x = 2y + 3z$ has no solutions in positive integers with all of $w, x, y$ and $z$ having the same color. (Note that $w, x, y$ and $z$ need not be distinct.)

Positive integers $ a$, $ b$, $ c$, and $ d$ satisfy $ a > b > c > d$, $ a \plus{} b \plus{} c \plus{} d \equal{} 2010$, and $ a^2 \minus{} b^2 \plus{} c^2 \minus{} d^2 \equal{} 2010$. Find the number of possible values of $ a$.

A girl and a guy are going to arrive at a train station. If they arrive within 10 minutes of each other, they will instantly fall in love and live happily ever after. But after 10 minutes, whichever one arrives first will fall asleep and they will be forever alone. The girl will arrive between 8 AM and 9 AM with equal probability. The guy will arrive between 7 AM and 8:30 AM, also with equal probability. Let $\frac pq$ for $p$, $q$ coprime be the probability that they fall in love. Find $p + q$.

Alice the ant starts at vertex $A$ of regular hexagon $ABCDEF$ and moves either right or left each move with equal probability. After $35$ moves, what is the probability that she is on either vertex $A$ or $C$? [i]2015 CCA Math Bonanza Lightning Round #5.3[/i]

Find the number of ways to tile a $12 \times 3$ board with $1 \times 4$ and $2 \times 2$ tiles with no overlap or uncovered space.

Let there be given a polygon $P$ which is mapped onto itself by two rotations: $\rho_1$ with center $O_1$ and angle $\omega_1$, and $\rho_2$ with center $O_2$ and angle $\omega_2~(0<\omega_i<2\pi)$. Show that the ratio $\frac{\omega_1}{\omega_2}$ is rational.

Let $ I $ be the incenter of triangle $ ABC $. The incircle touches $ BC, CA, AB$ at points $ P, Q, R $. A circle passing through $ B , C $ is tangent to the circle $I$ at point $ X $, a circle passing through $ C , A $ is tangent to the circle $I$ at point $ Y $, and a circle passing through $ A , B $ is tangent to the circle $I$ at point $ Z $, respectively. Prove that three lines $ PX, QY, RZ $ are concurrent.

Triangle $ABC$ has $BC<AC$ and circumradius $8$. Let $O$ be the circumcenter of $\triangle ABC$, $M$ be the midpoint of minor arc $AB$, and $C'$ be the reflection of $C$ across $OM$. If $AB$ bisects $\angle OAM$, and $\angle COC' = 120^\circ$, find the square of the area of the convex pentagon $CC'AMB$. [i]Team #4[/i]

If $f:\mathbb N\to\mathbb R$ is a function such that $$\prod_{d\mid n}f(d)=2^n$$holds for all $n\in\mathbb N$, show that $f$ sends $\mathbb N$ to $\mathbb N$.

Given triangle $ABC$. Let $A_1B_1$, $A_2B_2$,$ ...$, $A_{2008}B_{2008}$ be $2008$ lines parallel to $AB$ which divide triangle $ABC$ into $2009$ equal areas. Calculate the value of $$ \left\lfloor \frac{A_1B_1}{2A_2B_2} + \frac{A_1B_1}{2A_3B_3} + ... + \frac{A_1B_1}{2A_{2008}B_{2008}} \right\rfloor$$

On triangle $ABC$ let $D$ be the point on $AB$ so that $CD$ is an altitude of the triangle, and $E$ be the point on $BC$ so that $AE$ bisects angle $BAC.$ Let $G$ be the intersection of $AE$ and $CD,$ and let point $F$ be the intersection of side $AC$ and the ray $BG.$ If $AB$ has length $28,$ $AC$ has length $14,$ and $CD$ has length $10,$ then the length of $CF$ can be written as $\tfrac{k-m\sqrt{p}}{n}$ where $k, m, n,$ and $p$ are positive integers, $k$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $k - m + n + p.$

We number the columns of an $n\times n$-board from $1$ to $n$. In each cell, we place a number. This is done in such a way that each row precisely contains the numbers $1$ to $n$ (in some order), and also each column contains the numbers $1$ to $n$ (in some order). Next, each cell that contains a number greater than the cell's column number, is coloured grey. In the figure below you can see an example for the case $n = 3$. [asy] unitsize(0.6 cm); int i; fill((0,0)--(1,0)--(1,1)--(0,1)--cycle, gray(0.8)); fill(shift((1,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.8)); fill(shift((0,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.8)); for (i = 0; i <= 3; ++i) { draw((0,i)--(3,i)); draw((i,0)--(i,3)); } label("$1$", (0.5,3.5)); label("$2$", (1.5,3.5)); label("$3$", (2.5,3.5)); label("$3$", (0.5,2.5)); label("$1$", (1.5,2.5)); label("$2$", (2.5,2.5)); label("$1$", (0.5,1.5)); label("$2$", (1.5,1.5)); label("$3$", (2.5,1.5)); label("$2$", (0.5,0.5)); label("$3$", (1.5,0.5)); label("$1$", (2.5,0.5)); [/asy] (a) Suppose that $n = 5$. Can the numbers be placed in such a way that each row contains the same number of grey cells? (b) Suppose that $n = 10$. Can the numbers be placed in such a way that each row contains the same number of grey cells?

Prove that is $x,y$ are non negative integers then $5x\ge 7y$ if and only if there exist non-negative integers $(a,b,c,d)$ such that \[\left\{\begin{array}{l}x=a+2b+3c+7d\qquad\\ y=b+2c+5d\qquad\\ \end{array}\right.\]

Three points are chosen randomly and independently on a circle. The probability that all three pairwise distance between the points are less than the radius of the circle is $\frac{1}{K}$, $K\in\mathbb{N}$. Find $K$.

Let $S = \{(x, y) \in Z^2 | 0 \le x \le 11, 0\le y \le 9\}$. Compute the number of sequences $(s_0, s_1, . . . , s_n)$ of elements in $S$ (for any positive integer $n \ge 2$) that satisfy the following conditions: $\bullet$ $s_0 = (0, 0)$ and $s_1 = (1, 0)$, $\bullet$ $s_0, s_1, . . . , s_n$ are distinct, $\bullet$ for all integers $2 \le i \le n$, $s_i$ is obtained by rotating $s_{i-2}$ about $s_{i-1}$ by either $90^o$ or $180^o$ in the clockwise direction.

Let $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ be two squares such that the boundaries of $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ does not contain any line segment. Construct 16 line segments $A_iB_j$ for each possible $i,j \in \{1,2,3,4\}$. What is the maximum number of line segments that don't intersect the edges of $A_1A_2A_3A_4$ or $B_1B_2B_3B_4$? (intersection with a vertex is not counted). [i]Proposed by Allen Zheng[/i]

Color the six faces of a cube in six given colors. Each face is colored in exactly one color. Two faces with a common edge is in different colors. Then the number of ways to color the cube is________. Note: If we can make two cubes look the same by turning one of then, they are considered the same.

[b]p1.[/b] Nine coins are placed in a row, alternating between heads and tails as follows: $H T H T H T H T H$. A legal move consists of turning over any two adjacent coins. (a) Give a sequence of legal moves that changes the configuration into $H H H H H H H H H$. (b) Prove that there is no sequence of legal moves that changes the original configuration into $T T T T T T T T T$. [b]p2.[/b] Find (with proof) all integers $k $that satisfy the equation $$\frac{k - 15}{2000}+\frac{k - 12}{2003}+\frac{k - 9}{2006}+\frac{k - 6}{2009}+\frac{k - 3}{2012} = \frac{k - 2000}{15}+\frac{k - 2003}{12}+\frac{k - 2006}{9}+\frac{k - 2009}{6}+\frac{k - 2012}{3}.$$ [b]p3.[/b] Some (not necessarily distinct) natural numbers from $1$ to $2015$ are written on $2015$ lottery tickets, with exactly one number written on each ticket. It is known that the sum of the numbers on any nonempty subset of tickets (including the set of all tickets) is not divisible by $2016$. Prove that the same number is written on all of the tickets. [b]p4.[/b] A set of points $A$ is called distance-distinct if every pair of points in $A$ has a different distance. (a) Show that for all infinite sets of points $B$ on the real line, there exists an infinite distance-distinct set A contained in $B$. (b) Show that for all infinite sets of points $B$ on the real plane, there exists an infinite distance-distinct set A contained in $B$. [b]p5.[/b] Let $ABCD$ be a (not necessarily regular) tetrahedron and consider six points $E, F, G, H, I, J$ on its edges $AB$, $BC$, $AC$, $AD$, $BD$, $CD$, respectively, such that $$|AE| \cdot |EB| = |BF| \cdot |FC| = |AG| \cdot |GC| = |AH| \cdot |HD| = |BI| \cdot |ID| = |CJ| \cdot |JD|.$$ Prove that the points $E, F, G, H, I$, and $J$ lie on the surface of a sphere. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The number of revolutions of a wheel, with fixed center and with an outside diameter of $ 6$ feet, required to cause a point on the rim to go one mile is: $ \textbf{(A)}\ 880 \qquad\textbf{(B)}\ \frac{440}{\pi} \qquad\textbf{(C)}\ \frac{880}{\pi} \qquad\textbf{(D)}\ 440\pi \qquad\textbf{(E)}\ \text{none of these}$

Find all ordered pairs of positive integers $(m,n)$ for which there exists a set $C=\{c_1,\ldots,c_k\}$ ($k\ge1$) of colors and an assignment of colors to each of the $mn$ unit squares of a $m\times n$ grid such that for every color $c_i\in C$ and unit square $S$ of color $c_i$, exactly two direct (non-diagonal) neighbors of $S$ have color $c_i$. [i]David Yang.[/i]

Consider a parallelogram $ABCD$ such that the midpoint $M$ of the side $CD$ lies on the angle bisector of $\angle BAD$. Show that $\angle AMB$ is a right angle.

Let $a_n$ be the local maximum of $f_n(x)=\frac{x^ne^{-x+n\pi}}{n!}\ (n=1,\ 2,\ \cdots)$ for $x>0$. Find $\lim_{n\to\infty} \ln \left(\frac{a_{2n}}{a_n}\right)^{\frac{1}{n}}$.

Grandma has just finished baking a large rectangular pan of brownies. She is planning to make rectangular pieces of equal size and shape, with straight cuts parallel to the sides of the pan. Each cut must be made entirely across the pan. Grandma wants to make the same number of interior pieces as pieces along the perimeter of the pan. What is the greatest possible number of brownies she can produce? $(\textbf{A}) \: 24 \qquad (\textbf{B}) \: 30 \qquad (\textbf{C}) \: 48 \qquad (\textbf{D}) \: 60 \qquad (\textbf{E}) \: 64$