Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$

Given two skew perpendicular lines in space, find the set of the midpoints of all segments of given length with the endpoints on these lines.

Each of $n$ black squares and $n$ white squares can be obtained by a translation from each other. Every two squares of different colours have a common point. Prove that ther is a point belonging at least to $n$ squares. [i](V. Dolnikov)[/i]

Let $ABC$ be an acute triangle.The lines $l_1$ and $l_2$ are perpendicular to $AB$ at the points $A$ and $B$, respectively.The perpendicular lines from the midpoint $M$ of $AB$ to the lines $AC$ and $BC$ intersect $l_1$ and $l_2$ at the points $E$ and $F$, respectively.If $D$ is the intersection point of the lines $EF$ and $MC$, prove that \[\angle ADB = \angle EMF.\]

Let $m, n, k$ be positive integers such that $k\le mn$. Let $S$ be the set consisting of the $(m + 1)$-by-$(n + 1)$ rectangular array of points on the Cartesian plane with coordinates $(i, j)$ where $i, j$ are integers satisfying $0\le i\le m$ and $0\le j\le n$. The diagram below shows the example where $m = 3$ and $n = 5$, with the points of $S$ indicated by black dots: [asy] unitsize(1cm); int m=3; int n=5; int xmin=-2; int xmax=7; for (int i=xmin+1; i<=xmax-1; i+=1) { draw((xmin+0.5,i)--(xmax-0.5,i),gray); draw((i,xmin+0.5)--(i,xmax-0.5),gray); } draw((xmin-0.25,0)--(xmax+0.25,0),black,Arrow(2mm)); draw((0,xmin-0.25)--(0,xmax+0.25),black,Arrow(2mm)); for (int i=0; i<=m; ++i) { for (int j=0; j<=n; ++j) { fill(shift(i,j)*scale(.1)*unitcircle); }} label("$x$",(xmax+0.25,0),E); label("$y$",(0,xmax+0.25),N); [/asy]

Infinitely many equidistant parallel lines are drawn in the plane. A positive integer $n \geqslant 3$ is called frameable if it is possible to draw a regular polygon with $n$ sides all whose vertices lie on these lines, and no line contains more than one vertex of the polygon. (a) Show that $3, 4, 6$ are frameable. (b) Show that any integer $n \geqslant 7$ is not frameable. (c) Determine whether $5$ is frameable. [i]Proposed by Muralidharan[/i]

Alice and Bob are each secretly given a real number between 0 and 1 uniformly at random. Alice states, “My number is probably greater than yours.” Bob repudiates, saying, “No, my number is probably greater than yours!” Alice concedes, muttering, “Fine, your number is probably greater than mine.” If Bob and Alice are perfectly reasonable and logical, what is the probability that Bob’s number is actually greater than Alice’s?

A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple $(s_1, \dots, s_k)$ of cells in a $n \times n$ grid of square unit cells. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. If the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead. Determine whether there exists an integer $n > 1$ such that: one can place some snake of length $0.9n^2$ in an $n \times n$ grid which can turn around. [i]Nikolai Beluhov[/i]

Let $ABCD$ be a unit square. Let $Q_1$ be the midpoint of $\overline{CD}$. For $i=1,2,\dots,$ let $P_i$ be the intersection of $\overline{AQ_i}$ and $\overline{BD}$, and let $Q_{i+1}$ be the foot of the perpendicular from $P_i$ to $\overline{CD}$. What is $$\sum_{i=1}^{\infty} \text{Area of } \triangle DQ_i P_i \, ?$$ $\textbf{(A)}\ \frac{1}{6} \qquad \textbf{(B)}\ \frac{1}{4} \qquad \textbf{(C)}\ \frac{1}{3} \qquad \textbf{(D)}\ \frac{1}{2} \qquad \textbf{(E)}\ 1$

Let $ ABC$ a triangle and $ X$, $ Y$ and $ Z$ points at the segments $ BC$, $ AC$ and $ AB$, respectively.Let $ A'$, $ B'$ and $ C'$ the circuncenters of triangles $ AZY$,$ BXZ$,$ CYX$, respectively.Prove that $ 4(A'B'C')\geq(ABC)$ with equality if and only if $ AA'$, $ BB'$ and $ CC'$ are concurrents. Note: $ (XYZ)$ denotes the area of $ XYZ$

Let F be the midpoint of side BC or triangle ABC. Construct isosceles right triangles ABD and ACE externally on sides AB and AC with the right angles at D and E respectively. Show that DEF is an isosceles right triangle.