A quadrilateral $ABCD$ is inscribed in a circle and the lenght of side $AD$ equals the sum of the lenghts of the sides $AB$ and $CD$. Prove that the angle bisectors of $\angle ABC$ and $\angle BCD$ meet on the side $AD$.

Let $I$ be the incentre of acute-angled triangle $ABC$. Let the incircle meet $BC, CA$, and $AB$ at $D, E$, and $F,$ respectively. Let line $EF$ intersect the circumcircle of the triangle at $P$ and $Q$, such that $F$ lies between $E$ and $P$. Prove that $\angle DPA + \angle AQD =\angle QIP$. (Slovakia)

Numbers from$ 1$ to $8$ were written at the vertices of the cube, and on each edge the absolute value of the difference between the numbers at its ends.. What is the smallest number of different numbers that can be written on the edges?

What is the area of the region enclosed by the graph of the equations $x^2 - 14x + 3y + 70 = 21 + 11y - y^2$ that lies below the line $y = x-3$? $\text{(A) }6\pi\qquad\text{(B) }7\pi\qquad\text{(C) }8\pi\qquad\text{(D) }9\pi\qquad\text{(E) }10\pi$

Let $a, b, c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that $$\frac{1}{1+2ab}+\frac{1}{1+2bc}+\frac{1}{1+2ca}\ge 1$$

The figure obtained by removing one small unit square from the $2\times 2$ grid table is called an $L$ ''shape". .Put $k$ L-shapes in an $8\times 8$ grid table. Each $L$-shape can be rotated, but each $L$ shape is required to cover exactly three small unit squares in the grid table, and the common area covered by any two $L$ shapes is $0$, and except for these $k$ $L$ shapes, no other $L$ shapes can be placed. Find the minimum value of $k$.

Given a cyclic quadrilateral $ABCD$. Suppose $E, F, G, H$ are respectively the midpoint of the sides $AB, BC, CD, DA$. The line passing through $G$ and perpendicular on $AB$ intersects the line passing through $H$ and perpendicular on $BC$ at point $K$. Prove that $\angle EKF = \angle ABC$.

Let $P(x)=ax^3+(b-a)x^2-(c+b)x+c$ and $Q(x)=x^4+(b-1)x^3+(a-b)x^2-(c+a)x+c$ be polynomials of $x$ with $a,b,c$ non-zero real numbers and $b>0$.If $P(x)$ has three distinct real roots $x_0,x_1,x_2$ which are also roots of $Q(x)$ then: A)Prove that $abc>28$, B)If $a,b,c$ are non-zero integers with $b>0$,find all their possible values.

A circle is divided into arcs of equal size by $n$ points ($n \ge 1$). For any positive integer $x$, let $P_n(x)$ denote the number of possibilities for colouring all those points, using colours from $x$ given colours, so that any rotation of the colouring by $ i \cdot \frac{360^o}{n}$ , where i is a positive integer less than $n$, gives a colouring that differs from the original in at least one point. Prove that the function $P_n(x)$ is a polynomial with respect to $x$.

What is the remainder when $ 3^0\plus{}3^1\plus{}3^2\plus{}\ldots\plus{}3^{2009}$ is divided by $ 8$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 6$

For any integer $n$ we define the numbers $a = n^5 + 6n^3 + 8n$ ¸ $b = n^4 + 4n^2 + 3$. Prove that the numbers $a$ and $b$ are relatively prime or have the greatest common factor of $3$.

Let $ABC$ an acute triangle and $H$ its orthocenter. Let $E$ and $F$ be the intersection of lines $BH$ and $CH$ with $AC$ and $AB$ respectively, and let $D$ be the intersection of lines $EF$ and $BC$. Let $\Gamma_1$ be the circumcircle of $AEF$, and $\Gamma_2$ the circumcircle of $BHC$. The line $AD$ intersects $\Gamma_1$ at point $I \neq A$. Let $J$ be the feet of the internal bisector of $\angle{BHC}$ and $M$ the midpoint of the arc $\stackrel{\frown}{BC}$ from $\Gamma_2$ that contains the point $H$. The line $MJ$ intersects $\Gamma_2$ at point $N \neq M$. Show that the triangles $EIF$ and $CNB$ are similar.

Points $D$ and $E$ lie on the lines $BC$ and $AC$ respectively so that $B$ is between $C$ and $D$, $C$ is between $A$ and $E$, $BC = BD$ and $\angle BAD = \angle CDE$. It is known that the ratio of the perimeters of the triangles $ABC$ and $ADE$ is $2$. Find the ratio of the areas of these triangles.

Given a prime number $p>5$. It is known that the length of the smallest period of the fraction $1/p$ is a multiple of three. This period (including possible leading zeros) was written on a strip of paper and cut into three equal-length parts $a$, $b$, $c$ (they may also have leading zeros). What could be the sum of the three periodic fractions: $0.(a)$, $0.(b)$, and $0.(c)$? [i]Proposed by A. Khrabrov[/i]

$1989$ equal circles are arbitrarily placed on the table without overlap. What is the least number of colors are needed such that all the circles can be painted with any two tangential circles colored differently.

A circle with radius $1$ is circumscribed by a rhombus. What is the minimum possible area of this rhombus?

A sequence $\{x_n \}=x_0, x_1, x_2, \cdots $ satisfies $x_0=a(1\le a \le 2019, a \in \mathbb{R})$, and $$x_{n+1}=\begin{cases}1+1009x_n &\ (x_n \le 2) \\ 2021-x_n &\ (2<x_n \le 1010) \\ 3031-2x_n &\ (1010<x\le 1011) \\ 2020-x_n &\ (1011<x_n) \end{cases}$$ for each non-negative integer $n$. If there exist some integer $k>1$ such that $x_k=a$, call such minimum $k$ a [i] fundamental period[/i] of $\{x_n \}$. Find all integers which can be a fundamental period of some seqeunce; and for such minimal odd period $k(>1)$, find all values of $x_0=a$ such that the fundamental period of $\{x_n \}$ equals $k$.

Let $d \geq 1$ be an integer that is not the square of an integer. Prove that for every integer $n \geq 1,$ \[(n \sqrt d +1) \cdot | \sin(n \pi \sqrt d )| \geq 1\]

Let $A$ be a non-empty subset of $\mathbb{R}$ with the property that for every real numbers $x,y$, if $x+y\in A$ then $xy\in A$. Prove that $A=\mathbb{R}$.

Scientists perform an experiment on a colony of bacteria with an initial population of $32$. The scientists expose the bacteria to alternating rounds of light and darkness. They first put the bacteria in a bright environment for one hour before placing it in a dark room for the second hour, and then repeating this process. Because they are vulnerable to light, the population of the bacteria will be halved in one hour of exposure to sunlight. However, in one hour of darkness, the population triples. How many hours will it take for the bacteria’s population to exceed $150$? $\textbf{(A) }\text{between }4\text{ and }5\qquad\textbf{(B) }\text{between }5\text{ and }6\qquad\textbf{(C) }\text{between }6\text{ and }7\qquad\textbf{(D) }\text{between }7\text{ and }8\qquad\textbf{(E) }\text{between }8\text{ and }9$

For a multiple of $ kb$ of $ b$ let $ a \% kb$ be the greatest number such that $ a \% kb \equal{} a \bmod b$ which is smaller than $ kb$ and not greater than $ a$ itself. Let $ n \in \mathbb{Z}^ \plus{} .$ Determine all integer pairs $ (a,b)$ with: \[ a\%b \plus{} a\%2b \plus{} a\%3b \plus{} \ldots \plus{} a\%nb \equal{} a \plus{} b \]

A [i]triangulation[/i] $ \mathcal{T}$ of a polygon $ P$ is a finite collection of triangles whose union is $ P,$ and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side of $ P$ is a side of exactly one triangle in $ \mathcal{T}.$ Say that $ \mathcal{T}$ is [i]admissible[/i] if every internal vertex is shared by $ 6$ or more triangles. For example [asy] size(100); dot(dir(-100)^^dir(230)^^dir(160)^^dir(100)^^dir(50)^^dir(5)^^dir(-55)); draw(dir(-100)--dir(230)--dir(160)--dir(100)--dir(50)--dir(5)--dir(-55)--cycle); pair A = (0,-0.25); dot(A); draw(A--dir(-100)^^A--dir(230)^^A--dir(160)^^A--dir(100)^^A--dir(5)^^A--dir(-55)^^dir(5)--dir(100)); [/asy] Prove that there is an integer $ M_n,$ depending only on $ n,$ such that any admissible triangulation of a polygon $ P$ with $ n$ sides has at most $ M_n$ triangles.

Given $a_1, a_2, ... , a_n$. Define $$b_k = \frac{a_1 + a_2 + ... + a_k}{k}$$ for $1 \le k\le n.$ Let $$C = (a_1 - b_1)^2 + (a_2 - b_2)^2 + ... + (a_n - b_n)^2, D = (a_1 - b_n)^2 + (a_2 - b_n)^2 + ... + (a_n - b_n)^2$$ Prove that $C \le D \le 2C$.

Three friends are to divide five different jobs between each other so that nobody is left without a job. In how many different ways can this be done? A. 6 B. 25 C. 40 D. 90 E. 150

A red ball and a green ball are randomly and independently tossed into bins numbered with positive integers so that for each ball, the probability that it is tossed into bin $k$ is $2^{-k}$ for $k=1,2,3,\ldots.$ What is the probability that the red ball is tossed into a higher-numbered bin than the green ball? $\textbf{(A) } \frac{1}{4} \qquad\textbf{(B) } \frac{2}{7} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{3}{8} \qquad\textbf{(E) } \frac{3}{7}$