Let $ n$ and $ k$ be positive integers such that $ \frac{1}{2} n < k \leq \frac{2}{3} n.$ Find the least number $ m$ for which it is possible to place $ m$ pawns on $ m$ squares of an $ n \times n$ chessboard so that no column or row contains a block of $ k$ adjacent unoccupied squares.

On the number line, consider the point $x$ that corresponds to the value $10$. Consider $24$ distinct integer points $y_1$, $y_2$, $\ldots$, $y_{24}$ on the number line such that for all $k$ such that $1\leq k\leq 12$, we have that $y_{2k-1}$ is the reflection of $y_{2k}$ across $x$. Find the minimum possible value of \[\textstyle\sum_{n=1}^{24}(|y_n-1|+|y_n+1|).\]

Given a triangle $OAB$ with the vetices $O(0,\ 0,\ 0),\ A(1,\ 0,\ 0),\ B(1,\ 1,\ 0)$ in the $xyz$ space. Let $V$ be the cone obtained by rotating the triangle around the $x$-axis. Find the volume of the solid obtained by rotating the cone $V$ around the $y$-axis.

Excircle of triangle $ABC$ corresponding vertex $A$, is tangent to $BC$ at $P$. $AP$ intersects circumcircle of $ABC$ at $D$. Prove \[r(PCD)=r(PBD)\] whcih $r(PCD)$ and $r(PBD)$ are inradii of triangles $PCD$ and $PBD$.

Let $P(x, y)$ and $Q(x, y)$ be polynomials in two variables with integer coefficients. The sequences of integers $a_0, a_1,\ldots$ and $b_0, b_1,\ldots$ satisfy \[a_{n+1}=P(a_n,b_n),\quad b_{n+1}=Q(a_n,b_n)\]for all $n\geqslant 0$. Let $m_n$ be the number of integer points of the coordinate plane, lying strictly inside the segment with endpoints $(a_n,b_n)$ and $(a_{n+1},b_{n+1})$. Prove that the sequence $m_0,m_1,\ldots$ is non-decreasing.

Let the polynomials $ w_n $ be given by the formulas: $$ w_1(x) = x^2 - 1, \quad w_{n+1}(x) = w_n(x)^2 - 1, \quad (n = 1, 2, \ldots)$$ and let $a$ be a real number. How many different real solutions does the equation $ w_n(x) = a $ have?

Sabbir noticed one day that everyone in the city of BdMO has a distinct word of length $10$, where each letter is either $A$ or $B$. Sabbir saw that two citizens are friends if one of their words can be altered a few times using a special rule and transformed into the other ones word. The rule is, if somewhere in the word $ABB$ is located consecutively, then these letters can be changed to $BBA$ or if $BBA$ is located somewhere in the word consecutively, then these letters can be changed to $ABB$ (if wanted, the word can be kept as it is, without making this change.) For example $AABBA$ can be transformed into $AAABB$ (the opposite is also possible.) Now Sabbir made a team of $N$ citizens where no one is friends with anyone. What is the highest value of $N.$

Let \[ \vec{G}(x,y) = \left( \frac{-y}{x^2+4y^2}, \frac{x}{x^2+4y^2},0 \right). \] Prove or disprove that there is a vector-valued function \[ \vec{F}(x,y,z) = (M(x,y,z), N(x,y,z), P(x,y,z)) \] with the following properties: (i) $M,N,P$ have continuous partial derivatives for all $(x,y,z) \neq (0,0,0)$; (ii) $\mathrm{Curl}\,\vec{F} = \vec{0}$ for all $(x,y,z) \neq (0,0,0)$; (iii) $\vec{F}(x,y,0) = \vec{G}(x,y)$.

Let $a,b,$ and $c$ be real numbers such that $a^2(b+1)=1, b^2(c+a)=2,$ and $c^2(a+b)=5.$ Given that there are three possible values for $abc,$ compute the minimum possible value of $abc.$

The incircle of triangle $ABC$ touches $BC$ at $D$ and $AB$ at $F$, intersects the line $AD$ again at $H$ and the line $CF$ again at $K$. Prove that $\frac{FD\times HK}{FH\times DK}=3$

In a game, a participant chooses a nine-digit positive integer $\overline{ABCDEFGHI}$ with distinct non-zero digits. The score of the participant is $A^{B^{C^{D^{E^{F^{G^{H^{I}}}}}}}}$. Which nine-digit number should be chosen in order to maximise the score?

Let $t\ge\frac{1}{2}$ be a real number and $n$ a positive integer. Prove that \[t^{2n}\ge (t-1)^{2n}+(2t-1)^n\]

Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a continuous function such that the limit $$g(x)=\lim_{h\rightarrow 0}{\frac{f(x+h)-2f(x)+f(x-h)}{h^2}}$$ exists for all real $x$. Prove that $g(x)$ is constant if and only if $f(x)$ is a polynomial function whose degree is at most $2$.

Given a positive integer $n (n>2004)$, we put 1, 2, 3, …,$n^2$ into squares of an $n\times n$ chessboard with one number in a square. A square is called a “good square” if the square satisfies following conditions: 1) There are at least 2004 squares that are in the same row with the square such that any number within these 2004 squares is less than the number within the square. 2) There are at least 2004 squares that are in the same column with the square such that any number within these 2004 squares is less than the number within the square. Find the maximum value of the number of the “good square”.

$f(x) = \frac{12x+9}{19x+86}, \,\, x \ne -\frac{86}{19}$ Prove that $\exists ! \,\,\, {x_o \in R} \,\,\, \forall h_1,h_2 \in R [f(x_0+h_1)f(x_0-h_1)=f(x_0+h_2)f(x_0-h_2)]$, and calculate $x_0$.

In acute angled $\triangle ABC$, $AB > AC$, points $E, F$ lie on $AC, AB$ respectively, satisfying $BF+CE = BC$. Let $I_B, I_C$ be the excenters of $\triangle ABC$ opposite $B, C$ respectively, $EI_C, FI_B$ intersect at $T$, and let $K$ be the midpoint of arc $BAC$. Let $KT$ intersect the circumcircle of $\triangle ABC$ at $K,P$. Show $T,F,P,E$ concyclic.

The entries in a $ 3\times3$ array include all the digits from 1 through 9, arranged so that the entries in every row and column are in increasing order. How many such arrays are there? $ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 24\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 42\qquad\textbf{(E)}\ 60$

The sequence $(\chi_n) _{n=1}^{\infty}$ is defined as follows \begin{align*} \chi_{n+1}=\chi_n + \chi _{\lceil \frac{n}{2} \rceil} ~, \chi_1 =1 \end{align*} Prove that none of the terms of this sequence are divisible by $4$

Assume that a face of a convex polyhedron $ P$ has a common edge with every other face. Show that there exists a simple closed polygon that consists of edges of $ P$ and passes through all vertices. [i]L .Lovasz[/i]

(a) If $\displaystyle ABC$ is a triangle and $\displaystyle M$ is a point from its plane, then prove that \[ \displaystyle AM \sin A \leq BM \sin B + CM \sin C . \] (b) Let $\displaystyle A_1,B_1,C_1$ be points on the sides $\displaystyle (BC),(CA),(AB)$ of the triangle $\displaystyle ABC$, such that the angles of $\triangle A_1 B_1 C_1$ are $\widehat{A_1} = \alpha, \widehat{B_1} = \beta, \widehat{C_1} = \gamma$. Prove that \[ \displaystyle \sum A A_1 \sin \alpha \leq \sum BC \sin \alpha . \] [i]Dan Ştefan Marinescu, Viorel Cornea[/i]

Let $O$ be the circumcentre of the acute triangle $ABC$ and let lines $AO$ and $BC$ intersect at point $K$. On sides $AB$ and $AC$, points $L$ and $M$ are chosen such that $|KL|= |KB|$ and $|KM| = |KC|$. Prove that segments $LM$ and $BC$ are parallel.

A right circular cylinder is inscribed in a sphere of radius $\sqrt3$. What is the height of the cylinder when its volume is maximal?

$(SWE 3)$ Find the natural number $n$ with the following properties: $(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$ $(2)$ $n$ is the smallest integer with the above property.

The tangent at $C$ to $\Omega$, the circumcircle of scalene triangle $ABC$ intersects $AB$ at $D$. Through point $D$, a line is drawn that intersects segments $AC$ and $BC$ at $K$ and $L$ respectively. On the segment $AB$ points $M$ and $N$ are marked such that $AC \parallel NL$ and $BC \parallel KM$. Lines $NL$ and $KM$ intersect at point $P$ lying inside the triangle $ABC$. Let $\omega$ be the circumcircle of $MNP$. Suppose $CP$ intersects $\omega$ again at $Q$. Show that $DQ$ is tangent to $\omega$.

Given positive integers $n,k$, $n \ge 2$. Find the minimum constant $c$ satisfies the following assertion: For any positive integer $m$ and a $kn$-regular graph $G$ with $m$ vertices, one could color the vertices of $G$ with $n$ different colors, such that the number of monochrome edges is at most $cm$.