Show that there exists an integer $N$ such that for all $n \ge N$ a square can be partitioned into $n$ smaller squares.

Diagonals $AC$ and $BD$ of a trapezoid $ABCD$ meet at $P$. The circumcircles of triangles $ABP$ and $CDP$ intersect the line $AD$ for the second time at points $X$ and $Y$ respectively. Let $M$ be the midpoint of segment $XY$. Prove that $BM = CM$.

For all positive real numbers $a,b,c$ with $a+b+c=3$, show that $$a^3b+b^3c+c^3a+9\geq 4(ab+bc+ca).$$

Find the number of integers $c$ such that the equation $$\left||20|x|-x^2|-c\right|=21$$ has $12$ distinct real solutions.

Let be an infinite sequence $ \left( c_n \right)_{n\ge 1} $ of positive real numbers, with $ c_1=1, $ and satisfying $$ c_{n+1}-\frac{1}{c_{n+1}} =c_n+\frac{1}{c_n} , $$ for all natural numbers $ n. $ Prove that: [b]a)[/b] there exists a natural number $ k $ such that the sequence $ \left( c_n^k+\frac{1}{c_n^k} \right)_{n\ge 1} $ is an arithmetic one. [b]b)[/b] there exist two sequences $ \left( u_n \right)_{n\ge 1} ,\left( v_n \right)_{n\ge 1} $ of nonegative integers such that $ c_n=\sqrt{u_n} +\sqrt{v_n} , $ for any natural number $ n. $

Alice and Bob are play a game in a $(2n)*(2n)$ chess boared.Alice starts from the top right point moving 1 unit in every turn.Bob starts from the down left square and does the same.The goal of Alice is to make a closed shape ending in its start position and cannot reach any point that was reached before by any of players .if a players cannot move the other player keeps moving.what is the maximum are of the shape that the first player can build with every strategy of second player.

Let be given a parallelogram $ ABCD$ and two points $ A_1$, $ C_1$ on its sides $ AB$, $ BC$, respectively. Lines $ AC_1$ and $ CA_1$ meet at $ P$. Assume that the circumcircles of triangles $ AA_1P$ and $ CC_1P$ intersect at the second point $ Q$ inside triangle $ ACD$. Prove that $ \angle PDA \equal{} \angle QBA$.

Let $ABC$ be an acute triangle with circumcenter $O$ and orthocenter $H$. Rays $AO$, $CO$ intersect sides $BC, BA$ in points $A_1, C_1$ respectively, $K$ is the projection of $O$ onto the segment $A_1C_1$, $M$ is the midpoint of $AC$. Prove that $\angle HMA = \angle BKC_1$. [i]Proposed by Anton Trygub[/i]

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

$n$ is a given positive integer, such that it’s possible to weigh out the mass of any product weighing $1,2,3,\cdots ,n\text{g}$ with a counter balance and $k$ counterweights, whose weights are positive integers. [b](a)[/b] Find $f(n)$: the minumum value of $k$. [b](b)[/b] Find all possible number of $n,$ such that the mass of $f(n)$ counterweights is uniquely determined.

Cities $A$, $B$, $C$, $D$, and $E$ are connected by roads $\widetilde{AB}$, $\widetilde{AD}$, $\widetilde{AE}$, $\widetilde{BC}$, $\widetilde{BD}$, $\widetilde{CD}$, $\widetilde{DE}$. How many different routes are there from $A$ to $B$ that use each road exactly once? (Such a route will necessarily visit cities more than once.) [asy]unitsize(10mm); defaultpen(linewidth(1.2pt)+fontsize(10pt)); dotfactor=4; pair A=(1,0), B=(4.24,0), C=(5.24,3.08), D=(2.62,4.98), E=(0,3.08); dot (A); dot (B); dot (C); dot (D); dot (E); label("$A$",A,S); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,N); label("$E$",E,W); guide squiggly(path g, real stepsize, real slope=45) { real len = arclength(g); real step = len / round(len / stepsize); guide squig; for (real u = 0; u < len; u += step){ real a = arctime(g, u); real b = arctime(g, u + step / 2); pair p = point(g, a); pair q = point(g, b); pair np = unit( rotate(slope) * dir(g,a)); pair nq = unit( rotate(0 - slope) * dir(g,b)); squig = squig .. p{np} .. q{nq}; } squig = squig .. point(g, length(g)){unit(rotate(slope)*dir(g,length(g)))}; return squig; } pen pp = defaultpen + 2.718; draw(squiggly(A--B, 4.04, 30), pp); draw(squiggly(A--D, 7.777, 20), pp); draw(squiggly(A--E, 5.050, 15), pp); draw(squiggly(B--C, 5.050, 15), pp); draw(squiggly(B--D, 4.04, 20), pp); draw(squiggly(C--D, 2.718, 20), pp); draw(squiggly(D--E, 2.718, -60), pp); [/asy] $ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 9\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 18 $

Over each side of a cyclic quadrilateral erect a rectangle whose height is equal to the length of the opposite side. Prove that the centers of these rectangles form another rectangle.

Let $ABC$ be a scalene triangle, let $I$ be its incentre, and let $A_1$, $B_1$ and $C_1$ be the points of contact of the excircles with the sides $BC$, $CA$ and $AB$, respectively. Prove that the circumcircles of the triangles $AIA_1$, $BIB_1$ and $CIC_1$ have a common point different from $I$. [i]Cezar Lupu & Vlad Matei[/i]

The figure below contains two squares which share an edge, one with side length $200$ units and the other with side length $289$ units. The figure is divided into a whole number of regions, each with an equal whole number area but not necessarily of the same shape. Given that there is more than one region and each region has an area greater than $1$, find the sum of the number of regions and the area of each region. [asy] size(4cm); draw((0,0)--(200,0)--(200,200)--(0,200)--cycle); label("$200$",(0,0)--(200,0)); label("$289$",(200,0)--(489,0)); draw((200,0)--(489,0)--(489,289)--(200,289)--cycle); [/asy] $\textbf{(A) } 704\qquad\textbf{(B) } 874\qquad\textbf{(C) } 924\qquad\textbf{(D) } 978\qquad\textbf{(E) } 1028$

Let $H$ be an orthocenter of an acute triangle $ABC$. Prove that midpoints of $AB$ and $CH$ and intersection point of angle bisectors of $\angle CAH$ and $\angle CBH$ lie on the same line.

A tortoise walks $60$ meters per hour and a lizard walks at $240$ meters per hour. There is a rectangle $ABCD$ where $AB =60$ and $AD =120$. Both start from the vertex $A$ and in the same direction ($A \to B \to D \to A$), crossing the edge of the rectangle. The lizard has the habit of advancing two consecutive sides of the rectangle, turning to go back one, turning to go forward two, turning to go back one and so on. How many times and in what places do the tortoise and the lizard meet when the tortoise completes its third turn?