In triangle $ABC$, $AD$ is angle bisector ($D$ is on $BC$) if $AB+AD=CD$ and $AC+AD=BC$, what are the angles of $ABC$?

In trapezoid $ABCD,$ leg $\overline{BC}$ is perpendicular to bases $\overline{AB}$ and $\overline{CD},$ and diagonals $\overline{AC}$ and $\overline{BD}$ are perpendicular. Given that $AB=\sqrt{11}$ and $AD=\sqrt{1001},$ find $BC^2.$

Prove that $2\sqrt{1+x}+\sqrt{2x-3}+\sqrt{15-3x}<2\sqrt{19}$, where $\frac{3}{2}\leq x\leq5$.

The maximum possible number of knights are placed on a $5 \times 5$ chessboard so that no two attack each other. Prove that there is only one possible placement. (A Kanel)

Let $n$ be a natural number. We define $f(n)$ as the number of ways to express $n$ as a sum of powers of $2$, where the order of the terms is taken into account. For example, $f(4) = 6$, because $4$ can be written as: \begin{align*} 4;\\ 2 + 2;\\ 2 + 1 + 1;\\ 1 + 2 + 1;\\ 1 + 1 + 2;\\ 1 + 1 + 1 + 1. \end{align*} Find the smallest $n$ greater than $2019$ for which $f(n)$ is odd.

To the exterior of side $AB$ of square $ABCD$, we have drawn the regular triangle $ABE$. Point $A$ reflected on line $BE$ is $F$, and point $E$ reflected on line $BF$ is $G$. Let the perpendicular bisector of segment $FG$ meet segment $AD$ at $X$. Show that the circle centered at $X$ with radius $XA$ touches line$ FB$.

Let us consider every third degree polynomial $P(x)$ with coefficients as nonnegative positive integers such that $P(1)=20$. Among them determine polynomial for which is: $a)$ Minimal value of $P(4)$ $b)$ Maximal value of $P(3)/P(2)$

Find number of solutions in non-negative reals to the following equations: \begin{eqnarray*}x_1 + x_n ^2 = 4x_n \\ x_2 + x_1 ^2 = 4x_1 \\ ... \\ x_n + x_{n-1}^2 = 4x_{n-1} \end{eqnarray*}

What is the sum of real roots of the equation $x^4-4x^3+5x^2-4x+1 = 0$? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 1 $

Sequences $a_n$ and $b_n$ are defined for all positive integers $n$ such that $a_1 = 5,$ $b_1 = 7,$ $$a_{n+1} = \frac{\sqrt{(a_n+b_n-1)^2+(a_n-b_n+1)^2}}{2},$$ and $$b_{n+1} = \frac{\sqrt{(a_n+b_n+1)^2+(a_n-b_n-1)^2}}{2}.$$ $ $ \\ How many integers $n$ from 1 to 1000 satisfy the property that $a_n, b_n$ form the legs of a right triangle with a hypotenuse that has integer length?

Let $\triangle ABC$ be a triangle with $|AC|=2|AB|$ and let $O$ be its circumcenter. Let $D$ be the intersection of the bisector of $\angle A$ with $BC$. Let $E$ be the orthogonal projection of $O$ to $AD$ and let $F\ne D$ be the point on $AD$ satisfying $|CD|=|CF|$. Prove that $\angle EBF=\angle ECF$.

Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the number of integers $2 \le n \le 50$ such that $n$ divides $\phi^{!}(n)+1$.

For $-1 < r < 1$, let $S(r)$ denote the sum of the geometric series \[12 + 12r + 12r^2 + 12r^3 + \ldots.\] Let $a$ between $-1$ and $1$ satisfy $S(a)S(-a)=2016$. Find $S(a) + S(-a)$.

Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.

The license plate of each automobile in Iran consists of a two-digit and a three-digit number as well as a letter of the Persian alphabet. The digit $0$ is not used in the two numbers. To each license plate, we assign the product of the two numbers on it. For example, if the two numbers are $12$ and $365$ on a license plate, the assigned number would be $12 \times 365 = 4380$. What is the average of all the assigned numbers to all possible license plates?

Two triangles $ABC, A’B’C’$ have the same orthocenter $H$ and the same circumcircle with center $O$. Letting $PQR$ be the triangle formed by $AA’, BB’, CC’$, prove that the circumcenter of $PQR$ lies on $OH$.

For which maximal $N$ there exists an $N$-digit number with the following property: among any sequence of its consecutive decimal digits some digit is present once only? Alexey Glebov

Alex and Brian take turns shooting free throws until they each shoot twice. Alex and Brian have 80% and 60% chances of making their free throws, respectively. What is the probability that after each free throw they take, Alex has made at least as many free throws as Brian if Brian shoots first?

You are given a rectangular playing field of size $13 \times 2$ and any number of dominoes of sizes $2\times 1$ and $3\times 1$. The playing field should be seamless with such dominoes and without overlapping, with no domino protruding beyond the playing field may. Furthermore, all dominoes must be aligned in the same way, i. e. their long sides must be parallel to each other. How many such coverings are possible? (Walther Janous)

A large equilateral triangle is constructed by using toothpicks to create rows of small equilateral triangles. For example, in the figure we have $ 3$ rows of small congruent equilateral triangles, with $ 5$ small triangles in the base row. How many toothpicks would be needed to construct a large equilateral triangle if the base row of the triangle consists of $ 2003$ small equilateral triangles? [asy]unitsize(15mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); pair Ap=(0,0), Bp=(1,0), Cp=(2,0), Dp=(3,0), Gp=dir(60); pair Fp=shift(Gp)*Bp, Ep=shift(Gp)*Cp; pair Hp=shift(Gp)*Gp, Ip=shift(Gp)*Fp; pair Jp=shift(Gp)*Hp; pair[] points={Ap,Bp,Cp,Dp,Ep,Fp,Gp,Hp,Ip,Jp}; draw(Ap--Dp--Jp--cycle); draw(Gp--Bp--Ip--Hp--Cp--Ep--cycle); for(pair p : points) { fill(circle(p, 0.07),white); } pair[] Cn=new pair[5]; Cn[0]=centroid(Ap,Bp,Gp); Cn[1]=centroid(Gp,Bp,Fp); Cn[2]=centroid(Bp,Fp,Cp); Cn[3]=centroid(Cp,Fp,Ep); Cn[4]=centroid(Cp,Ep,Dp); label("$1$",Cn[0]); label("$2$",Cn[1]); label("$3$",Cn[2]); label("$4$",Cn[3]); label("$5$",Cn[4]); for (pair p : Cn) { draw(circle(p,0.1)); }[/asy] $ \textbf{(A)}\ 1,\!004,\!004 \qquad \textbf{(B)}\ 1,\!005,\!006 \qquad \textbf{(C)}\ 1,\!507,\!509 \qquad \textbf{(D)}\ 3,\!015,\!018 \qquad \textbf{(E)}\ 6,\!021,\!018$

Anumber of schools took part in a tennis tournament. No two players from the same school played against each other. Every two players from different schools played exactly one match against each other. A match between two boys or between two girls was called a [i]single[/i] and that between a boy and a girl was called a [i]mixed single[/i]. The total number of boys differed from the total number of girls by at most 1. The total number of singles differed from the total number of mixed singles by at most 1. At most how many schools were represented by an odd number of players?

Find integer solutions $(x,y)$ of the equation ($1964$ times "$\sqrt{}$"): $$\sqrt{x+\sqrt{x+\sqrt{....\sqrt{x+\sqrt{x}}}}}=y$$

Consider the sequence of integers $ \left( a_n\right)_{n\ge 0} $ defined as $$ a_n=\left\{\begin{matrix}n^6-2017, & 7|n\\ \frac{1}{7}\left( n^6-2017\right) , & 7\not | n\end{matrix}\right. . $$ Determine the largest length a string of consecutive terms from this sequence sharing a common divisor greater than $ 1 $ may have.

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

We are given a chessboard with 100 rows and 100 columns. Two squares of the board are said to be adjacent if they have a common side. Initially all squares are white. a) Is it possible to colour an odd number of squares in such a way that each coloured square has an odd number of adjacent coloured squares? b) Is it possible to colour some squares in such a way that an odd number of them have exactly $4$ adjacent coloured squares and all the remaining coloured squares have exactly $2$ adjacent coloured squares? c) Is it possible to colour some squares in such a way that an odd number of them have exactly $2$ adjacent coloured squares and all the remaining coloured squares have exactly $4$ adjacent coloured squares?