Each of the small squares of a $50\times 50$ table is coloured in red or blue. Initially all squares are red. A [i]step[/i] means changing the colour of all squares on a row or on a column. a) Prove that there exists no sequence of steps, such that at the end there are exactly $2011$ blue squares. b) Describe a sequence of steps, such that at the end exactly $2010$ squares are blue. [i]Adriana & Lucian Dragomir[/i]

Three circles are constructed for the triangle $ABC $: the circle ${{w} _ {A}} $ passes through the vertices $B $ and $C $ and intersects the sides $AB $ and $ AC $ at points ${{A} _ {1}} $ and ${{A} _ {2}} $ respectively, the circle ${{w} _ {B}} $ passes through the vertices $A $ and $C $ and intersects the sides $BA $ and $BC $ at the points ${{B} _ {1}} $ and ${{B} _ {2}} $, ${{w} _ {C}} $ passes through the vertices $A $ and $B $ and intersects the sides $CA $ and $CB $ at the points ${{C} _ {1}} $ and ${{C} _ {2}} $. Let ${{A} _ {1}} {{A} _ {2}} \cap {{B} _ {1}} {{B} _ {2}} = {C} '$, ${{A} _ {1}} {{A} _ {2}} \cap {{C} _ {1}} {{C} _ {2}} = {B} '$ ta ${ {B} _ {1}} {{B} _ {2}} \cap {{C} _ {1}} {{C} _ {2}} = {A} '$ is Prove that the perpendiculars, which are omitted from the points ${A} ', \, \, {B}', \, \, {C} '$ to the lines $BC $, $CA $ and $AB $ respectively intersect at one point. (Rudenko Alexander)

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

In the beginning, there are $100$ cards on the table, and each card has a positive integer written on it. An odd number is written on exactly $43$ cards. Every minute, the following operation is performed: for all possible sets of $3$ cards on the table, the product of the numbers on these three cards is calculated, all the obtained results are summed, and this sum is written on a new card and placed on the table. A day later, it turns out that there is a card on the table, the number written on this card is divisible by $2^{2018}.$ Prove that one hour after the start of the process, there was a card on the table that the number written on that card is divisible by $2^{2018}.$

The figure shows a triangle, a circle circumscribed around it and the center of its inscribed circle. Using only one ruler (one-sided, without divisions), construct the center of the circumscribed circle.

In the triangle $ABC$ the angle bisector $AD$ is drawn, $E$ is the point of tangency of the inscribed circle to the side $BC$, $I$ is the center of the inscribed circle $\Delta ABC$. The point ${{A} _ {1}}$ on the circumscribed circle $\Delta ABC$ is such that $A {{A} _ {1}} || BC$. Denote by $T$ - the second point of intersection of the line $E {{A} _ {1}}$ and the circumscribed circle $\Delta AED$. Prove that $IT = IA$.

At a party, each man danced with exactly three women and each woman danced with exactly two men. Twelve men attended the party. How many women attended the party? $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 18\qquad \textbf{(E)}\ 24$

Let $ A_1,A_2,...$ be a sequence of infinite sets such that $ |A_i \cap A_j| \leq 2$ for $ i \not\equal{}j$. Show that the sequence of indices can be divided into two disjoint sequences $ i_1<i_2<...$ and $ j_1<j_2<...$ in such a way that, for some sets $ E$ and $ F$, $ |A_{i_n} \cap E|\equal{}1$ and $ |A_{j_n} \cap F|\equal{}1$ for $ n\equal{}1,2,... .$ [i]P. Erdos[/i]

Kelvin the Frog likes numbers whose digits strictly decrease, but numbers that violate this condition in at most one place are good enough. In other words, if $d_i$ denotes the $i$th digit, then $d_i\le d_{i+1}$ for at most one value of $i$. For example, Kelvin likes the numbers $43210$, $132$, and $3$, but not the numbers $1337$ and $123$. How many $5$-digit numbers does Kelvin like?

Given that \[\frac{a-b}{c-d}=2\quad\text{and}\quad\frac{a-c}{b-d}=3\] for certain real numbers $a,b,c,d$, determine the value of \[\frac{a-d}{b-c}.\]

Prove that a positive integer can be expressed in the form $3x^2+y^2$ iff it can also be expressed in form $u^2+uv+v^2$, where $x,y,u,v$ are all positive integers.

Chords $A_1A_2, A_3A_4, A_5A_6$ of a circle $\Omega$ concur at point $O$. Let $B_i$ be the second common point of $\Omega$ and the circle with diameter $OA_i$ . Prove that chords $B_1B_2, B_3B_4, B_5B_6$ concur.

Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if (i) $a_n < a_{n+1}$ for all $n\ge 1$, (ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.

Let $f(n)$ be a function from integers to integers. Suppose $f(11) = 1$, and $f(a)f(b) = f(a +b) + f(a - b)$, for all integers $a, b$. Find $f(2013)$.

A circus act consists of $2024$ bamboo sticks of pairwise different heights placed in some order, with a monkey standing atop one of them. The circus master can then give commands to the monkey as follows: [color=#FFFFFF]___[/color]$\bullet$ Left! : When given this command, the monkey locates the closest bamboo stick to the left taller than the one it is currently atop, and jumps to it. If there is no such stick, the monkey stays put. [color=#FFFFFF]___[/color]$\bullet$ Right! : When given this command, the monkey locates the closest bamboo stick to the right taller than the one it is currently atop, and jumps to it. If there is no such stick, the monkey stays put. The circus master claims that given any two bamboo sticks, if the monkey is originally atop the shorter stick, then after giving at most $c$ commands he can reposition the monkey atop the taller stick. What is the smallest possible value of $c$? [i]Proposed by Archit Manas[/i]

Let $P_1$ be a convex polyhedron with vertices $A_1,A_2,\ldots,A_9$. Let $P_i$ be the polyhedron obtained from $P_1$ by a translation that moves $A_1$ to $A_i$. Prove that at least two of the polyhedra $P_1,P_2,\ldots,P_9$ have an interior point in common.

Suppose that $c\in\left(\frac{1}{2},1\right)$. Find the least $M$ such that for every integer $n\ge 2$ and real numbers $0<a_1\le a_2\le\ldots \le a_n$, if $\frac{1}{n}\sum_{k=1}^{n}ka_{k}=c\sum_{k=1}^{n}a_{k}$, then we always have that $\sum_{k=1}^{n}a_{k}\le M\sum_{k=1}^{m}a_{k}$ where $m=[cn]$

Let $ABCD$ be rhombus, with $\angle ABC = 80^o$: Let $E$ be midpoint of $BC$ and $F$ be perpendicular projection of $A$ onto $DE$. Find the measure of $\angle DFC$ in degree.

In a scalene triangle one angle is exactly two times as big as another one and some angle in this triangle is $36^o$. Find all possibilities, how big the angles of this triangle can be.

$n$ people live in a town, and they are members of some clubs (residents can be members of more than one club). No matter how we choose some (but at least one) clubs, there is a resident of the town who is the member of an odd number of the chosen clubs. Prove that the number of clubs is at most $n$. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

Two circles $O_1$ and $O_2$ intersect each other at $M$ and $N$. The common tangent to two circles nearer to $M$ touch $O_1$ and $O_2$ at $A$ and $B$ respectively. Let $C$ and $D$ be the reflection of $A$ and $B$ respectively with respect to $M$. The circumcircle of the triangle $DCM$ intersect circles $O_1$ and $O_2$ respectively at points $E$ and $F$ (both distinct from $M$). Show that the circumcircles of triangles $MEF$ and $NEF$ have same radius length.

In acute $\triangle ABC,$ let $I$ denote the incenter and suppose that line $AI$ intersects segment $BC$ at a point $D.$ Given that $AI=3, ID=2,$ and $BI^2+CI^2=64,$ compute $BC^2.$ [i]Proposed by Kyle Lee[/i]

Find all positive integers $k$ for which there are infinitely many positive integers $n$ such that $\binom{(2025+k)n}{2025n}$ is not divisible by $kn+1$.

Prove that $ \frac{\pi}{2}\minus{}1<\int_{0}^{1}e^{\minus{}2x^{2}}\ dx$.

Let $ABCD$ be a cyclic quadrilateral. Prove that \[ |AB - CD| + |AD - BC| \geq 2|AC - BD|. \]