A point $X$ is marked on the base $BC$ of an isosceles $\triangle ABC$, and points $P$ and $Q$ are marked on the sides $AB$ and $AC$ so that $APXQ$ is a parallelogram. Prove that the point $Y$ symmetrical to $X$ with respect to line $PQ$ lies on the circumcircle of the $\triangle ABC$. [i]($5$ points)[/i]

Crocodile chooses $1$ x $4$ tile from $2018$ x $2018$ square.The bear has tilometer that checks $3$x$3$ square of $2018$ x $2018$ is there any of choosen cells by crocodile.Tilometer says "YES" if there is at least one choosen cell among checked $3$ x $3$ square.For what is the smallest number of such questions the Bear can certainly get an affirmative answer?

Find all functions $f: R \to R$ that satisfy $f (x) + 2f (\sqrt[3]{1-x^3}) = x^3$ for all real $x$. (Here $\sqrt[3]{x}$ is defined all over $R$.)

A regular dodecahedron is a convex polyhedra that its faces are regular pentagons. The regular dodecahedron has twenty vertices and there are three edges connected to each vertex. Suppose that we have marked ten vertices of the regular dodecahedron. [b]a)[/b] prove that we can rotate the dodecahedron in such a way that at most four marked vertices go to a place that there was a marked vertex before. [b]b)[/b] prove that the number four in previous part can't be replaced with three. [i]proposed by Kasra Alishahi[/i]

Given is a trihedral angle with edges $ SA $, $ SB $, $ SC $, all plane angles of which are acute, and the dihedral angle at edge $ SA $ is right. Prove that the section of this triangle with any plane perpendicular to any edge, at a point different from the vertex $ S $, is a right triangle.

Andover has a special weather forecast this week. On Monday, there is a $\frac{1}{2}$ chance of rain. On Tuesday, there is a $\frac{1}{3}$ chance of rain. This pattern continues all the way to Sunday, when there is a $\frac{1}{8}$ chance of rain. The probability that it doesn't rain in Andover all week can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

In an acute-angled triangle $\triangle ABC$, construct $\triangle ACD$ and $\triangle BCE$ externally on sides $CA$ and $CB$ respectively, such that $AD=CD$. Let $M$ be the midpoint of $AB$, and connect $DM$ and $EM$. Given that $DM$ is perpendicular to $EM$, set $\frac{AC}{BC} =u$ and $\frac{DM}{EM}=v$. Express $\frac{DC}{EC}$ in terms of $u$ and $v$.

Suppose that $a_1,a_2,\cdots,a_{100}\in\mathbb{R}^+$ such that $a_i\geq a_{101-i}\,(i=1,2,\cdots,50).$ Let $x_k=\frac{ka_{k+1}}{a_1+a_2+\cdots+a_k}\,(k=1,2,\cdots,99).$ Prove that $$x_1x_2^2\cdots x_{99}^{99}\leq 1.$$

Cai and Lai are eating cookies. Their cookies are in the shape of $2$ regular hexagons glued to each other, and the cookies have area $18$ units. They each make a cut along the $2$ long diagonals of a cookie; this now makes four pieces for them to eat and enjoy. What is the minimum area among the four pieces? [i]Proposed by Richard Chen[/i]

Let $O$ be the circumcenter of the triangle $ABC$. Points $D,E$ are on sides $AC,AB$ and points $P,Q,R,S$ are given in plane such that $P,C$ and $R,C$ are on different sides of $AB$ and pints $Q,B$ and $S,B$ are on different sides of $AC$ such that $R,S$ lie on circumcircle of $DAP,EAQ$ and $\triangle BCE \sim \triangle ADQ , \triangle CBD \sim \triangle AEP$(In that order), $\angle ARE=\angle ASD=\angle BAC$, If $RS\| PQ$ prove that $RE ,DS$ are concurrent on $AO$. [i]Proposed by Alireza Dadgarnia[/i]

A gambler offers you a $2$ dollar ticket to play the following game: First, you pick a real number $0 \leq p \leq 1$, then you are given a weighted coin that comes up heads with probability $p$. If you receive $1$ dollar the [i]first[/i] time you flip a tail, and if you receive $2$ dollars [i]first[/i] time you flip a head, what is the optimal expected net winning of flipping the coin twice?

Ten girls, numbered from 1 to 10, sit at a round table, in a random order. Each girl then receives a new number, namely the sum of her own number and those of her two neighbours. Prove that some girl receives a new number greater than 17.

Given a positive real $t$, a set $S$ of nonnegative reals is called $t$-good if for any two distinct elements $a,b$ in $S$, $\frac{a+b}2\ge\sqrt{ab}+t$. For all positive reals $N$, find the maximum number of elements a $t$-good set can have, if all elements are at most $N$. [i](Proposed by Ho Janson)[/i]

Let $ABC$ be an arbitrary triangle and $M$ a point inside it. Let $d_a, d_b, d_c$ be the distances from $M$ to sides $BC,CA,AB$; $a, b, c$ the lengths of the sides respectively, and $S$ the area of the triangle $ABC$. Prove the inequality \[abd_ad_b + bcd_bd_c + cad_cd_a \leq \frac{4S^2}{3}.\] Prove that the left-hand side attains its maximum when $M$ is the centroid of the triangle.

Let $f : (0,+\infty) \to \mathbb{R}$ a convex function and $\alpha, \beta, \gamma > 0$. Then $$\frac{1}{6\alpha}\int \limits_0^{6\alpha}f(x)dx\ +\ \frac{1}{6\beta}\int \limits_0^{6\beta}f(x)dx\ +\ \frac{1}{6\gamma}\int \limits_0^{6\gamma}f(x)dx$$ $$\geq \frac{1}{3\alpha +2\beta +\gamma}\int \limits_0^{3\alpha +2\beta +\gamma}f(x)dx\ +\ \frac{1}{\alpha +3\beta +2\gamma}\int \limits_0^{\alpha +3\beta +2\gamma}f(x)dx\ $$ $$+\ \frac{1}{2\alpha +\beta +3\gamma}\int \limits_0^{2\alpha +\beta +3\gamma}f(x)dx$$

a) Does there exist a function $f: N \to N$ such that $f(f(n))=f(n+1) - f(n)$ for all $n \in N$? b) Does there exist a function $f: N \to N$ such that $f(f(n))=f(n+2) - f(n)$ for all $n \in N$? I. Voronovich

Let $x_1$, ... , $x_{n+1} \in [0,1] $ and $x_1=x_{n+1} $. Prove that \[ \prod_{i=1}^{n} (1-x_ix_{i+1}+x_i^2)\ge 1. \] A. Khrabrov, F. Petrov

Does there exist a natural number $n$ with exactly 3 different prime divisors $p$, $q$, and $r$, so that $p-1\mid n$, $qr-1\mid n$, $q-1\nmid n$, $r-1\nmid n$, and $3\nmid q+r$?

Prove that there are infinitely many positive integers $n$ such that $\Delta = nr^2$, where $\Delta$ and $r$ are respectively the area and the inradius of a triangle with integer sides.

The sides of an equilateral triangle with sides of length $n$ have been divided into equal parts, each of length $1$, and lines have been drawn through the points of division parallel to the sides of the triangle, thus dividing the large triangle into many small triangles. Nils has a pile of rhombic tiles, each of side $1$ and angles $60^\circ$ and $120^\circ$, and wants to tile most of the triangle using these, so that each tile covers two small triangles with no overlap. In the picture, three tiles are placed somewhat arbitrarily as an illustration. How many tiles can Nils fit inside the triangle? [asy] /* original code by fedja: https://artofproblemsolving.com/community/c68h207503p1220868 modified by Klaus-Anton: https://artofproblemsolving.com/community/c2083h3267391_draw_me_a_grid_of_regular_triangles */ size(5cm); int n=6; pair A=(1,0), B=dir(60); path P=A--B--(0,0)--cycle; path Pp=A--shift(A)*B--B--cycle; /* label("$A$",A,S); label("$B$",B,dir(120)); label("$(0,0)$",(0,0),dir(210)); fill(shift(2*A-1+2*B-1)*P,yellow+white); fill(shift(2*A-1+2*B-0)*P,yellow+white); fill(shift(2*A-1+2*B+1)*P,yellow+white); fill(shift(2*A-1+2*B+2)*P,yellow+white); fill(shift(1*A-1+1*B)*P,blue+white); fill(shift(2*A-1+1*B)*P,blue+white); fill(shift(3*A-1+1*B)*P,blue+white); fill(shift(4*A-1+1*B)*P,blue+white); fill(shift(5*A-1+1*B)*P,blue+white); fill(shift(0*A+0*B)*P,green+white); fill(shift(0*A+1+0*B)*P,green+white); fill(shift(0*A+2+0*B)*P,green+white); fill(shift(0*A+3+0*B)*P,green+white); fill(shift(0*A+4+0*B)*P,green+white); fill(shift(0*A+5+0*B)*P,green+white); fill(shift(2*A-1+3*B-1)*P,magenta+white); fill(shift(3*A-1+3*B-1)*P,magenta+white); fill(shift(4*A-1+3*B-1)*P,magenta+white); fill(shift(5*A+5*B-5)*P,heavyred+white); fill(shift(4*A+4*B-4)*P,palered+white); fill(shift(4*A+4*B-3)*P,palered+white); fill(shift(0*A+0*B)*Pp,gray); fill(shift(0*A+1+0*B)*Pp,gray); fill(shift(0*A+2+0*B)*Pp,gray); fill(shift(0*A+3+0*B)*Pp,gray); fill(shift(0*A+4+0*B)*Pp,gray); fill(shift(1*A+1*B-1)*Pp,lightgray); fill(shift(1*A+1*B-0)*Pp,lightgray); fill(shift(1*A+1*B+1)*Pp,lightgray); fill(shift(1*A+1*B+2)*Pp,lightgray); fill(shift(2*A+2*B-2)*Pp,red); fill(shift(2*A+2*B-1)*Pp,red); fill(shift(2*A+2*B-0)*Pp,red); fill(shift(3*A+3*B-2)*Pp,blue); fill(shift(3*A+3*B-3)*Pp,blue); fill(shift(4*A+4*B-4)*Pp,cyan); fill(shift(0*A+1+0*B)*Pp,gray); fill(shift(0*A+2+0*B)*Pp,gray); fill(shift(0*A+3+0*B)*Pp,gray); fill(shift(0*A+4+0*B)*Pp,gray); */ fill(Pp, rgb(244, 215, 158)); fill(shift(dir(60))*P, rgb(244, 215, 158)); fill(shift(1.5,(-sqrt(3)/2))*shift(2*dir(60))*Pp, rgb(244, 215, 158)); fill(shift(1.5,(-sqrt(3)/2))*shift(2*dir(60))*P, rgb(244, 215, 158)); fill(shift(-.5,(-sqrt(3)/2))*shift(4*dir(60))*Pp, rgb(244, 215, 158)); fill(shift(.5,(-sqrt(3)/2))*shift(4*dir(60))*P, rgb(244, 215, 158)); for(int i=0;i<n;++i){ for(int j;j<n-i;++j) {draw(shift(i*A+j*B)*P);}} shipout(bbox(2mm,Fill(white))); [/asy]

There are $3$ unit squares in a row as shown in the figure below. Each side of this figure is painted by one of the three colors: Blue, Green or Red. It is known that for any square, all the three colors are used and no two adjacent sides have the same color. Find the number of possible colorings. [img]https://cdn.artofproblemsolving.com/attachments/e/c/8963e6716b7d9b23479dd7e106b4bd9a3267c1.png[/img] A. $48$ B. $96$ C. $108$ D. $192$ E. $216$

Given a positive integer $N$. There are three squirrels that each have an integer. It is known that the largest integer and the least one differ by exactly $N$. Each time, the squirrel with the second largest integer looks at the squirrel with the largest integer. If the integers they have are different, then the squirrel with the second largest integer would be unhappy and attack the squirrel with the largest one, making its integer decrease by two times the difference between the two integers. If the second largest integer is the same as the least integer, only of the squirrels would attack the squirrel with the largest integer. The attack continues until the largest integer becomes the same as the second largest integer. What is the maximum total number of attacks these squirrels make? Proposed by USJL, ST.

Prove the identity $\sum_{k=2}^{n} k(k-1)\binom{n}{k} =\binom{n}{2} 2^{n-1}$ for all $n=2,3,4,...$

The circle $C_1$ and $C_2$ are externally tangent to each other at $T$. A line passing through $T$ meets $C_1$ at $A$ and meets $C_2$ at $B$. The line which is tangent to $C_1$ at $A$ meets $C_2$ at $D$ and $E$. If $D \in [AE]$, $|TA|=a$, $|TB|=b$, what is $|BE|$? $ \textbf{(A)}\ \sqrt{a(a+b)} \qquad\textbf{(B)}\ \sqrt{a^2+b^2+ab} \qquad\textbf{(C)}\ \sqrt{a^2+b^2-ab} \qquad\textbf{(D)}\ \sqrt{a^2+b^2} \qquad\textbf{(E)}\ \sqrt{(a+b)b} $

Suppose $n$ and $r$ are nonnegative integers such that no number of the form $n^2+r-k(k+1) \text{ }(k\in\mathbb{N})$ equals to $-1$ or a positive composite number. Show that $4n^2+4r+1$ is $1$, $9$, or prime.