[b]1.[/b] Consider in the plane a set $H$ of pairwise disjoint circles of radius 1 such that, for infinitely many positive integers $n$, the circle $k_n$ with centre at the origin and of radius $n$ contains at least $cn^2$ elements of the set $H$. Prove that there exists a straight line which intersects infinitely many of the circles of $H$. Show further that if we require only that the circles $k_n$ contain o(n²) elements of $H$, the proposition will be false. [b](G. 5)[/b]

The quadratic polynomials $f$ and $g$ with real coefficients are such that if $g(x)$ is an integer for some $x>0$, then so is $f(x)$. Prove that there exist integers $m,n$ such that $f(x)=mg(x)+n$ for all $x$.

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

Suppose that $f:[0,1]\to\mathbb R$ is a continuously differentiable function such that $f(0)=f(1)=0$ and $f(a)=\sqrt3$ for some $a\in(0,1)$. Prove that there exist two tangents to the graph of $f$ that form an equilateral triangle with an appropriate segment of the $x$-axis.

Let $O$ be the circumcenter and $H$ the orthocenter of an acute triangle $ABC$. Prove that the area of one of the triangles $AOH$, $BOH$ and $COH$ is equal to the sum of the areas of the other two.

In square $ABCD$ (labeled clockwise), let $P$ be any point on $BC$ and construct square $APRS$ (labeled clockwise). Prove that line $CR$ is tangent to the circumcircle of triangle $ABC$.

The plane is covered with circles in such a way that the center of each circle does not belong to any other circle. Prove that each point of the plane belongs to at most five circles.

There are many cities in penguin's land. A road runs between some of them, which either can be one or two lanes. When two streets meet outside of a city, it becomes prevent traffic chaos by building a bridge and avoiding any junctions. Now the penguin parliament has passed a new law, according to which every street is only a one-way street may be used. The Minister of Transport now liked the direction of each street stipulate that in each city at most one lane more or less leads in and out. He also knows that the streets of every city have odd number of tracks. Show that he can succeed in his endeavor.

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.