Let $ABC$ be a triangle with circumcircle $\Gamma$ and incenter $I$ and let $M$ be the midpoint of $\overline{BC}$. The points $D$, $E$, $F$ are selected on sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ such that $\overline{ID} \perp \overline{BC}$, $\overline{IE}\perp \overline{AI}$, and $\overline{IF}\perp \overline{AI}$. Suppose that the circumcircle of $\triangle AEF$ intersects $\Gamma$ at a point $X$ other than $A$. Prove that lines $XD$ and $AM$ meet on $\Gamma$. [i]Proposed by Evan Chen, Taiwan[/i]

Let $ ABCD$ be a cyclic quadrilateral and $ r$ and $ s$ the lines obtained reflecting $ AB$ with respect to the internal bisectors of $ \angle CAD$ and $ \angle CBD$, respectively. If $ P$ is the intersection of $ r$ and $ s$ and $ O$ is the center of the circumscribed circle of $ ABCD$, prove that $ OP$ is perpendicular to $ CD$.

Let $O $, $O_1$, $O_2 $, $O_3$, $O_4$ be points such that $O_1$, $O$, $O_3$ and $O_2$, $O$, $O_4$ are collinear in that order, $OO_1 =1$, $OO_2 = 2$, $OO_3 =\sqrt2$, $OO_4 = 2$, and $\angle O_1OO_2 = 45^o$. Let $\omega_1$, $\omega_2$, $\omega_3$, $\omega_4$ be the circles with respective centers $O_1$, $O_2$ , $O_3$, $O_4$ that go through $O$. Let $A$ be the intersection of $\omega_1$ and $\omega_2$, $B$ be the intersection of $\omega_2$ and $\omega_3$, $C$ be the intersection of $\omega_3$ and $\omega_4$, and $D$ be the intersection of $\omega_4$ and $\omega_1$ with $A$, $B$, $C$, $D$ all distinct from $O$. What is the largest possible area of a convex quadrilateral $P_1P_2P_3P_4$ such that $P_i$ lies on $O_i$ and that $A$, $B$, $C$, $D$ all lie on its perimeter?

I plotted the graphs $y=(x-0)^2, y=(x-5)^2, \ldots, y=(x-45)^2.$ I also draw a line $y=k,$ and notice that it intersects the parabolas at exactly $19$ distinct points. What is $k$?

Consider a complex number whose affix in the complex plane is situated on the first quadrant of the unit circle centered at origin. Then, the following inequality holds. $$ \sqrt{2} +\sqrt{2+\sqrt{2}} \le |1+z|+|1+z^2|+|1+z^4|\le 6 $$ [i]Costică Ambrinoc[/i]

The main building of ETH Zurich is a rectangle divided into unit squares. Every side of a square is a wall, with certain walls having doors. The outer wall of the main building has no doors. A number of participants of the SMO have gathered in the main building lost. You can only move from one square to another through doors. We have indicates that there is a walkable path between every two squares of the main building. Cyril wants the participants to find each other again by having everyone on the same square leads. To do this, he can give them the following instructions via walkie-talkie: North, East, South or West. After each instruction, each participant simultaneously attempts a square in that direction to go. If there is no door in the corresponding wall, he remains standing. Show that Cyril can reach his goal after a finite number of directions, no matter which one square the participants at the beginning. [hide=original wording]Das Hauptgebäude der ETH Zürich ist ein in Einheitsquadrate unterteiltes Rechteck. Jede Seite eines Quadrates ist eine Wand, wobei gewisse Wände Türen haben. Die Aussenwand des Hauptgebäudes hat keine Türen. Eine Anzahl von Teilnehmern der SMO hat sich im Hauptgebäude verirrt. Sie können sich nur durch Türen von einem Quadrat zum anderen bewegen. Wir nehmen an, dass zwischen je zwei Quadraten des Hauptgebäudes ein begehbarer Weg existiert. Cyril möchte erreichen, dass sich die Teilnehmer wieder nden, indem er alle auf dasselbe Quadrat führt. Dazu kann er ihnen per Walkie-Talkie folgende Anweisungen geben: Nord, Ost, Süd oder West. Nach jeder Anweisung versucht jeder Teilnehmer gleichzeitig, ein Quadrat in diese Richtung zu gehen. Falls in der entsprechenden Wand keine Türe ist, bleibt er stehen. Zeige, dass Cyril sein Ziel nach endlich vielen Anweisungen erreichen kann, egal auf welchen Quadraten sich die Teilnehmer am Anfang benden. [/hide]

For a positive integer $n$, let $\mathcal{D}(n)$ be the value obtained by, starting from the left, alternating between adding and subtracting the digits of $n$. For example, $\mathcal{D}(321)=3-2+1=2$, while $\mathcal{D}(40)=4-0=4$. Compute the value of the sum \[\sum_{n=1}^{100}\mathcal{D}(n)=\mathcal{D}(1)+\mathcal{D}(2)+\dots+\mathcal{D}(100).\]

A unit square is removed from the corner of an $n \times n$ grid, where $n \geq 2$. Prove that the remainder can be covered by copies of the figures of $3$ or $5$ unit squares depicted in the drawing below. [asy] import geometry; draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle); draw((-3.5,1)--(-2.5,1)--(-2.5,0)); draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle); draw((1.5,0)--(1.5,1)); draw((2.5,0)--(2.5,1)); draw((0.5,1)--(1.5,1)); draw((0.5,2)--(1.5,2)); [/asy] [b]Note:[/b] Every square must be covered once and figures must not go over the bounds of the grid.

In the obtuse triangle $ABC$, $AM = MB, MD \perp BC, EC \perp BC$. If the area of $\triangle ABC$ is 24, then the area of $\triangle BED$ is [asy] size(200); defaultpen(linewidth(0.8)+fontsize(11pt)); pair A = (6.5,3.2), B = origin, C = (5.0), D = (3.3,0); pair Xc = (C.x,4), Xd = (D.x,4), E = intersectionpoint(A--B,C--Xc), M = intersectionpoint(D--Xd, A--B); draw(C--A--B--C--E--D--M); label("$A$",A,NE); label("$B$",B,W); label("$C$",C,SE); label("$D$",D,S); label("$E$",E,N); label("$M$",M,N); draw(rightanglemark(D,C,E,7)^^rightanglemark(B,D,M,7)); [/asy] $\textbf{(A) }9\qquad \textbf{(B) }12\qquad \textbf{(C) }15\qquad \textbf{(D) }18\qquad \textbf{(E) }\text{not uniquely determined}$

Find all triples $(x,y,z)$ of real numbers satisfying the system of equations $\left\{\begin{matrix} 3(x+\frac{1}{x})=4(y+\frac{1}{y})=5(z+\frac{1}{z}),\\ xy+yz+zx=1.\end{matrix}\right.$

Find the sum of all positive integers $k$ such that the sum of $k$ consecutive integers, starting from $20$, is a triangular number. \\(A triangular number is of the form $1+2+\dots+j$ for some integer $j$.) [i]Team #5[/i]

Find all natural numbers $n$ such that the equation $x^2 + y^2 + z^2 = nxyz$ has solutions in positive integers

The plane is covered with network of regular congruent disjoint hexagons. Prove that there cannot exist a square which has its four vertices in the vertices of the hexagons. [i]Gabriel Nagy[/i]

If $n \in N$ and $0 < x <\frac{\pi}{2n}$, prove the inequality $\frac{\sin 2x}{\sin x}+\frac{\sin 3x}{\sin 2x} +...+\frac{\sin (n+1)x}{\sin nx} < 2\frac{\cos x}{\sin^2 x}$. .

In a school there are totally $n > 2$ classes and not all of them have the same numbers of students. It is given that each class has one head student. The students in each class wear hats of the same color and different classes have different hat colors. One day all the students of the school stand in a circle facing toward the center, in an arbitrary order, to play a game. Every minute, each student put his hat on the person standing next to him on the right. Show that at some moment, there are $2$ head students wearing hats of the same color.

In 27,000 fertilization trials with phosphorus fertilizers, the following average average crop yields for potatoes were found: $$Fertilizer \,\, application \,\,based \,\,on \,\,P2O5 (dt/ha) \ '\ crop \,\, yield \,\, (dt/ha)$$ $$0.0 \ \ 237$$ $$0.3 \ \ 251$$ $$0.9 \ \ 269$$ The relationship between the fertilizer application $x$ (in dt/ha) and the crop yield $y$ (in dt/ha), can be approximated by the following relation: $$y = a - b \cdot 10^{-kx}$$ where $a, b$ and $k$ are constants. a) Calculate these constants using the values given above! b) Calculate the crop yield for a fertilizer application of $0.6$ dt/ha and $1.2$ dt/ha! c) Set the percentage deviation of the calculated values from those determined in the experiment values $261$ dt/ha or $275$ dt/ha.

We consider the following system with $q=2p$: \[\begin{matrix} a_{11}x_{1}+\ldots+a_{1q}x_{q}=0,\\ a_{21}x_{1}+\ldots+a_{2q}x_{q}=0,\\ \ldots ,\\ a_{p1}x_{1}+\ldots+a_{pq}x_{q}=0,\\ \end{matrix}\] in which every coefficient is an element from the set $\{-1,0,1\}$$.$ Prove that there exists a solution $x_{1}, \ldots,x_{q}$ for the system with the properties: [b]a.)[/b] all $x_{j}, j=1,\ldots,q$ are integers$;$ [b]b.)[/b] there exists at least one j for which $x_{j} \neq 0;$ [b]c.)[/b] $|x_{j}| \leq q$ for any $j=1, \ldots ,q.$

Alice is wandering in the country of Wanderland. Wanderland consists of a finite number of cities, some of which are connected by two-way trains, such that Wanderland is connected: given any two cities, there is always a way to get from one to the other through a series of train rides. Alice starts at Riverbank City and wants to end up at Conscious City. Every day, she picks a train going out of the city she is in uniformly at random among all of the trains, and then boards that train to the city it leads to. Show that the expected number of days it takes for her to reach Conscious City is finite.

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that \[f(x+y) + f(x)f(y) = f(xy) + (y+1)f(x) + (x+1)f(y)\] for all $x,y \in \mathbb{R}$.

Let $M$ be a point on the diameter $AB$ of a semicircle $\Gamma$. The perpendicular at $M$ meets the semicircle $\Gamma$ at $P$. A circle inside $\Gamma$. touches $\Gamma$. and is tangent to $PM$ at $Q$ and $AM$ at $R$. Prove that $P B = RB$.

Let $f: [0,1]\rightarrow \mathbb{R}$ continuous. We say that $f$ crosses the axis at $x$ if $f(x)=0$ but $\exists y,z \in [x-\epsilon,x+\epsilon]: f(y)<0<f(z)$ for any $\epsilon$. (a) Give an example of a function that crosses the axis infinitely often. (b) Can a continuous function cross the axis uncountably often?

Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. Let the line passing through $I$ and perpendicular to $CI$ intersect the segment $BC$ and the arc $BC$ (not containing $A$) of $\Omega$ at points $U$ and $V$ , respectively. Let the line passing through $U$ and parallel to $AI$ intersect $AV$ at $X$, and let the line passing through $V$ and parallel to $AI$ intersect $AB$ at $Y$ . Let $W$ and $Z$ be the midpoints of $AX$ and $BC$, respectively. Prove that if the points $I, X,$ and $Y$ are collinear, then the points $I, W ,$ and $Z$ are also collinear. [i]Proposed by David B. Rush, USA[/i]

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

Given integers $a$, $ b$ and $c$, $c\ne b$. It is known that the square trinomials $ax^2 + bx + c$ and $(c-b)x^2 + (c- a)x + (a + b)$ have a common root (not necessarily integer). Prove that $a+b+2c$ is divisible by $3$.

Triangle $ABC$ has sides $AB = 25$, $BC = 30$, and $CA=20$. Let $P,Q$ be the points on segments $AB,AC$, respectively, such that $AP=5$ and $AQ=4$. Suppose lines $BQ$ and $CP$ intersect at $R$ and the circumcircles of $\triangle{BPR}$ and $\triangle{CQR}$ intersect at a second point $S\ne R$. If the length of segment $SA$ can be expressed in the form $\frac{m}{\sqrt{n}}$ for positive integers $m,n$, where $n$ is not divisible by the square of any prime, find $m+n$. [i]Victor Wang[/i]