The angle bisector of $A$ in triangle $ABC$ intersects $BC$ in the point $D$. The point $E$ lies on the side $AC$, and the lines $AD$ and $BE$ intersect in the point $F$. Furthermore, $\frac{|AF|}{|F D|}= 3$ and $\frac{|BF|}{|F E|}=\frac{5}{3}$. Prove that $|AB| = |AC|$. [img]https://1.bp.blogspot.com/-evofDCeJWPY/XzT9dmxXzVI/AAAAAAAAMVY/ZN87X3Cg8iMiULwvMhgFrXbdd_f1f-JWwCLcBGAsYHQ/s0/2013%2BMohr%2Bp5.png[/img]

While Steve and LeRoy are fishing $ 1$ mile from shore, their boat springs a leak, and water comes in at a constant rate of $ 10$ gallons per minute. The boat will sink if it takes in more than $ 30$ gallons of water. Steve starts rowing toward the shore at a constant rate of $ 4$ miles per hour while LeRoy bails water out of the boat. What is the slowest rate, in gallons per minute, at which LeRoy can bail if they are to reach the shore without sinking? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 10$

Find all positive integers $m$ for which there exist three positive integers $a,b,c$ such that $abcm=1+a^2+b^2+c^2$.

Let $a_1,a_2,\dots,a_{100}$ be a sequence of integers. Initially, $a_1=1$, $a_2=-1$ and the remaining numbers are $0$. After every second, we perform the following process on the sequence: for $i=1,2,\dots,99$, replace $a_i$ with $a_i+a_{i+1}$, and replace $a_{100}$ with $a_{100}+a_1$. (All of this is done simultaneously, so each new term is the sum of two terms of the sequence from before any replacements.) Show that for any integer $M$, there is some index $i$ and some time $t$ for which $|a_i|>M$ at time $t$.

Each vertex of a right $n$-gon $(n\geq 3)$ is colored in yellow, blue or red. On each turn are chosen two adjacent vertices in different color and then are recolored in the third. For which $n$ can we get from an arbitrary coloring of the $n$-gon a monochromatic one (in one color)?

Let the incircle of triangle $ ABC$ touch sides $ BC,\, CA$ and $ AB$ at $ D,\, E$ and $ F,$ respectively. Let $ \omega,\,\omega_{1},\,\omega_{2}$ and $ \omega_{3}$ denote the circumcircles of triangle $ ABC,\, AEF,\, BDF$ and $ CDE$ respectively. Let $ \omega$ and $ \omega_{1}$ intersect at $ A$ and $ P,\,\omega$ and $ \omega_{2}$ intersect at $ B$ and $ Q,\,\omega$ and $ \omega_{3}$ intersect at $ C$ and $ R.$ $ a.$ Prove that $ \omega_{1},\,\omega_{2}$ and $ \omega_{3}$ intersect in a common point. $ b.$ Show that $ PD,\, QE$ and $ RF$ are concurrent.

Prove that, we can't find positive numbers $m$ and $n$ such that, $$m^2+(m+1)^2=n^4+(n+1)^4$$

In an acute triangle $\triangle ABC$, the midpoint of $BC$ is $M$. Perpendicular lines $BE$ and $CF$ are drawn respectively on $AC$ from $B$ and on $AB$ from $C$ such that $E$ and $F$ lie on $AC$ and $AB$ respectively. The midpoint of $EF$ is $N.$ $MN$ intersects $AB$ at $K.$ Prove that, the four points $B,K,E,M$ lie on the same circle.

Find the minimum value of $ f(a)=\int_{0}^{1}x|x-a|\ dx$.

$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

Let $ABCD$ be a quadrilateral inscribed in a unit circle with center $O$. Suppose that $\angle AOB = \angle COD = 135^\circ$, $BC=1$. Let $B^\prime$ and $C^\prime$ be the reflections of $A$ across $BO$ and $CO$ respectively. Let $H_1$ and $H_2$ be the orthocenters of $AB^\prime C^\prime$ and $BCD$, respectively. If $M$ is the midpoint of $OH_1$, and $O^\prime$ is the reflection of $O$ about the midpoint of $MH_2$, compute $OO^\prime$.

A rectangle is decomposed by $6$ vertical lines and $6$ horizontal lines in the $49$ small rectangles (see figure). The perimeter of each small rectangle is known to be a whole number of meters. In this case, will the perimeter of the large rectangle be a whole number of meters? [asy] unitsize(0.8 cm); draw((0,0)--(8.6,0)--(8.6,4.2)--(0,4.2)--cycle, linewidth(1.5*bp)); draw((0.7,0)--(0.7,4.2)); draw((1.2,0)--(1.2,4.2)); draw((4.1,0)--(4.1,4.2)); draw((5.6,0)--(5.6,4.2)); draw((6.0,0)--(6.0,4.2)); draw((7.4,0)--(7.4,4.2)); draw((0,0.4)--(8.6,0.4)); draw((0,1.0)--(8.6,1.0)); draw((0,1.5)--(8.6,1.5)); draw((0,2.5)--(8.6,2.5)); draw((0,3.1)--(8.6,3.1)); draw((0,3.5)--(8.6,3.5)); [/asy]

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

A line meets a segment $AB$ at point $C$. Which is the maximal number of points $X$ of this line such that one of angles $AXC$ and $BXC$ is equlal to a half of the second one?

Let $f(x)=\frac{\sqrt{2+\sqrt2}x+\sqrt{2-\sqrt2}}{-\sqrt{2-\sqrt2}x+\sqrt{2+\sqrt2}}$. Find $\underbrace{f(f(\cdots f}_{1987\text{ times}}(x)\cdots))$.

Let $x_1,x_2,...,x_n \in [0;1]$ prove that $x_1(1-x_2)+x_2(1-x_3)+...+x_{n-1}(1-x_n)+x_n(1-x_1) \leq [\frac{n}{2}]$

The area of the rectangular region is [asy] draw((0,0)--(4,0)--(4,2.2)--(0,2.2)--cycle,linewidth(.5 mm)); label(".22 m",(4,1.1),E); label(".4 m",(2,0),S); [/asy] $\text{(A)}\ \text{.088 m}^2 \qquad \text{(B)}\ \text{.62 m}^2 \qquad \text{(C)}\ \text{.88 m}^2 \qquad \text{(D)}\ \text{1.24 m}^2 \qquad \text{(E)}\ \text{4.22 m}^2$

Solve the following system of equations in real numbers: $$\left\{\begin{array}{l}x^2=y^2+z^2,\\x^{2024}=y^{2024}+z^{2024},\\x^{2025}=y^{2025}+z^{2025}.\end{array}\right.$$ [i]Proposed by Mykhailo Shtandenko, Anton Trygub, Bogdan Rublov[/i]

In the quadrilateral $ABCD$ it is known that $ABC + DBC = 180^o$ and $ADC + BDC = 180^o$. Prove that the center of the circle circumscribed around the triangle $BCD$ lies on the diagonal $AC$.

Determine the least $n\in\mathbb{N}$ such that $n!=1\cdot 2\cdot 3\cdots (n-1)\cdot n$ has at least $2010$ positive factors.

Let $ p(x) $ be a quadratic polynomial for which : \[ |p(x)| \leq 1 \qquad \forall x \in \{-1,0,1\} \] Prove that: \[ \ |p(x)|\leq\frac{5}{4} \qquad \forall x \in [-1,1]\]

A round robin tournament is held with $2016$ participants. Each round, after seeing the results from the previous round, the tournament organizer chooses two players to play a game with each other that will result in a win for one of the players and a loss for the other. The tournament organizer wants each person to have a different total number of wins at the end of $k$ rounds. Find the minimum possible value of $k$ for which this can always be guaranteed. [i]Proposed by Nathan Ramesh

Given a $10 \times 10$ chessboard colored as black-and-white alternately. Prove that for any $46$ unit squares without common edges, there are at least $30$ unit squares with the same color.

In the coordinate plane, find the area of the region bounded by the curve $ C: y\equal{}\frac{x\plus{}1}{x^2\plus{}1}$ and the line $ L: y\equal{}1$.

Three cyclists started simultaneously on three parallel straight paths (at the time of the start, the athletes were on the same straight line). Cyclists travel at constant speeds. $1$ second after the start, the triangle formed by the cyclists had an area of ​​$5$ m$^2$. What area will such a triangle have in $10$ seconds after the start?