[b]9.[/b] Lep $p$ be a connected non-closed broken line without self-intersection in the plane $\varphi $. Prove that if $v$ is a non-zero vector in $\varphi $ and $p$ has a commom point with the broken line $p+v$, then $p$ has a common point with the broken line $p+\alpha v$ too, where $\alpha =\frac{1}{n}$ and $n$ is a positive integer. Does a similar statemente hold for other positive values of $\alpha$? ($p+v$ denotes the broken line obtained from $p$ through displacemente by the vector $v$.) [b](G. 1)[/b]

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.$

A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? $ \textbf{(A) }39 \qquad \textbf{(B) }71 \qquad \textbf{(C) }73 \qquad \textbf{(D) }75 \qquad \textbf{(E) }135 \qquad $

Let $\triangle P_1P_2P_3$ be an equilateral triangle. For each $n\ge 4$, [i]Mingmingsan[/i] can set $P_n$ as the circumcenter or orthocenter of $\triangle P_{n-3}P_{n-2}P_{n-1}$. Find all positive integer $n$ such that [i]Mingmingsan[/i] has a strategy to make $P_n$ equals to the circumcenter of $\triangle P_1P_2P_3$. [i]Proposed by Li4 and Untro368.[/i]

On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue. At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet. After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls. Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?

Eight spheres of radius 1, one per octant, are each tangent to the coordinate planes. What is the radius of the smallest sphere, centered at the origin, that contains these eight spheres? $ \textbf{(A)}\ \sqrt 2\qquad \textbf{(B)}\ \sqrt 3\qquad \textbf{(C)}\ 1 \plus{} \sqrt 2\qquad \textbf{(D)}\ 1 \plus{} \sqrt 3\qquad \textbf{(E)}\ 3$

Let $ABC$ be a triangle with $BC=20$ and $CA=16$, and let $I$ be its incenter. If the altitude from $A$ to $BC$, the perpendicular bisector of $AC$, and the line through $I$ perpendicular to $AB$ intersect at a common point, then the length $AB$ can be written as $m+\sqrt{n}$ for positive integers $m$ and $n$. What is $100m+n$? [i] Proposed by Tristan Shin [/i]

Right triangle $ABC$ has side lengths $BC=6$, $AC=8$, and $AB=10$. A circle centered at $O$ is tangent to line $BC$ at $B$ and passes through $A$. A circle centered at $P$ is tangent to line $AC$ at $A$ and passes through $B$. What is $OP$? $\textbf{(A)} ~\frac{23}{8}\qquad\textbf{(B)} ~\frac{29}{10}\qquad\textbf{(C)} ~\frac{35}{12}\qquad\textbf{(D)} ~\frac{73}{25}\qquad\textbf{(E)} ~3$

Let $ABCD$ be a tetrahedron such that $AB = CD = \sqrt{41}$, $AC = BD = \sqrt{80}$, and $BC = AD = \sqrt{89}$. There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt{n}}{p}$, when $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$.

Fix an integer $n \geq 2$. An $n\times n$ sieve is an $n\times n$ array with $n$ cells removed so that exactly one cell is removed from every row and every column. A stick is a $1\times k$ or $k\times 1$ array for any positive integer $k$. For any sieve $A$, let $m(A)$ be the minimal number of sticks required to partition $A$. Find all possible values of $m(A)$, as $A$ varies over all possible $n\times n$ sieves. [i]Palmer Mebane[/i]

Let $ABC$ be a triangle with $AB = 3, AC = 4,$ and $BC = 5$, let $P$ be a point on $BC$, and let $Q$ be the point (other than $A$) where the line through $A$ and $P$ intersects the circumcircle of $ABC$. Prove that \[PQ\le \frac{25}{4\sqrt{6}}.\]

Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation. It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.

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.\]

Is it possible to tile $2003 \times 2003$ board by $1 \times 2$ dominoes placed horizontally and $1 \times 3$ rectangles placed vertically?