Given a rectangle $ABCD$. Points $E$ and $F$ lie on sides $BC$ and $CD$ respectively so that the area of triangles $ABE$, $ECF$, $FDA$ is equal to $1$. Determine the area of triangle $AEF$.

Let $ABCD$ be a convex quadrilateral whose sides $AD$ and $BC$ are not parallel. Suppose that the circles with diameters $AB$ and $CD$ meet at points $E$ and $F$ inside the quadrilateral. Let $\omega_E$ be the circle through the feet of the perpendiculars from $E$ to the lines $AB,BC$ and $CD$. Let $\omega_F$ be the circle through the feet of the perpendiculars from $F$ to the lines $CD,DA$ and $AB$. Prove that the midpoint of the segment $EF$ lies on the line through the two intersections of $\omega_E$ and $\omega_F$. [i]Proposed by Carlos Yuzo Shine, Brazil[/i]

Let $p$ be a prime number greater than 10. Prove that there exist positive integers $m$ and $n$ such that $m+n < p$ and $5^m 7^n-1$ is divisible by $p$.

Let $ABC$ be an acute angled triangle and let $P, Q$ be points on $AB, AC$ respectively, such that $PQ$ is parallel to $BC$. Points $X, Y$ are given on line segments $BQ, CP$ respectively, such that $\angle AXP = \angle XCB$ and $\angle AYQ = \angle YBC$. Prove that $AX = AY$. [i]Proposed by Ervin Maci$\acute{c},$ Bosnia and Herzegovina[/i]

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

a) Let $a,b$ and $c$ be side lengths of a triangle with perimeter $4$. Show that \[a^2+b^2+c^2+abc<8.\] b) Is there a real number $d<8$ such that for all triangles with perimeter $4$ we have \[a^2+b^2+c^2+abc<d \quad\] where $a,b$ and $c$ are the side lengths of the triangle?

Let $\triangle ABC$ be an acute triangle with circumcircle $\Gamma$, and let $P$ be the midpoint of the minor arc $BC$ of $\Gamma$. Let $AP$ and $BC$ meet at $D$, and let $M$ be the midpoint of $AB$. Also, let $E$ be the point such that $AE\perp AB$ and $BE\perp MP$. Prove that $AE=DE$.

A regular $2015$-simplex $\mathcal P$ has $2016$ vertices in $2015$-dimensional space such that the distances between every pair of vertices are equal. Let $S$ be the set of points contained inside $\mathcal P$ that are closer to its center than any of its vertices. The ratio of the volume of $S$ to the volume of $\mathcal P$ is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find the remainder when $m+n$ is divided by $1000$. [i] Proposed by James Lin [/i]

A triangle $ABC$ is given in which $\angle BAC = 40^o$. and $\angle ABC = 20^o$. Find the length of the angle bisector drawn from the vertex $C$, if it is known that the sides $AB$ and $BC$ differ by $4$ centimeters.

In the $43$ dimension Euclidean space the convex hull of finite set $S$ contains polyhedron $P$. We know that $P$ has $47$ vertices. Prove that it is possible to choose at most $2021$ points in $S$ such that the convex hull of these points also contain $P$, and this is sharp.

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

Prove that numbers $1,2,...,16$ can be divided in sequence such that sum of any two neighboring numbers is perfect square

Let $n$ be a positive integer greater than $1$. Evaluate the following summation: \[ \sum_{k=0}^{n-1} \frac{1}{1 + 8 \sin^2 \left( \frac{k \pi}{n} \right)}. \]

In trapezoid $ABCD$, the sum of the lengths of the bases $AB$ and $CD$ is equal to the length of the diagonal $BD$. Let $M$ denote the midpoint of $BC$, and let $E$ denote the reflection of $C$ about the line $DM$. Prove that $\angle AEB=\angle ACD$.

On a blackboard are written all the integers from $1$ to $2008$ inclusive. Two numbers are deleted and their difference is written. For example, if you erase $5$ and $241$, you write $236$. This continues, erasing two numbers and writing their difference, until only one number remains. Determine if the number left at the end can be $2008$. What about $2007$? In each case, if the answer is affirmative, indicate a sequence with that final number, and if it is negative, explain why.

The internal angles of quadrilateral $ABCD$ form an arithmetic progression. Triangles $ABD$ and $DCB$ are similar with $\angle DBA=\angle DCB$ and $\angle ADB=\angle CBD$. Moreover, the angles in each of these two triangles also form an arithmetic progression. In degrees, what is the largest possible sum of the two largest angles of $ABCD$? ${\textbf{(A)}\ 210\qquad\textbf{(B)}\ 220\qquad\textbf{(C)}\ 230\qquad\textbf{(D}}\ 240\qquad\textbf{(E)}\ 250$

Given a right $ n $ -angle $ {{A} _ {1}} {{A} _ {2}} \ldots {{A} _ {n}} $, $n \ge 4 $, and a point $ M $ inside it. Prove the inequality $$\sin (\angle {{A} _ {1}} M {{A} _ {2}}) + \sin (\angle {{A} _ {2}} M {{A} _ {3}} ) + \ldots + \sin (\angle {{A} _ {n}} M {{A} _ {1}})> \sin \frac{2 \pi}{n} + (n-2) sin \frac{\pi}{n}$$

A graph with $10^{100}$ vertices satisfies the following condition: Any simple odd cycle has length > 100. Prove there is an independent set in the graph of size at least $\frac{10^{100}}{102}$

Let there be given an acute angle $\angle AOB = 3\alpha$, where $\overline{OA}= \overline{OB}$. The point $A$ is the center of a circle with radius $\overline{OA}$. A line $s$ parallel to $OA$ passes through $B$. Inside the given angle a variable line $t$ is drawn through $O$. It meets the circle in $O$ and $C$ and the given line $s$ in $D$, where $\angle AOC = x$. Starting from an arbitrarily chosen position $t_0$ of $t$, the series $t_0, t_1, t_2, \ldots$ is determined by defining $\overline{BD_{i+1}}=\overline{OC_i}$ for each $i$ (in which $C_i$ and $D_i$ denote the positions of $C$ and $D$, corresponding to $t_i$). Making use of the graphical representations of $BD$ and $OC$ as functions of $x$, determine the behavior of $t_i$ for $i\to \infty$.

A teacher gives each student in the class the following task in their exercise book . "Take two concentric circles of radius $1$ and $10$ . To the smaller circle produce three tangents whose intersections $A, B$ and $C$ lie in the larger circle . Measure the area $S$ of triangle $ABC$, and areas $S_1 , S_2$ and $S_3$ , the three sector-like regions with vertices at $A, B$ and $C$ (as in the diagram). Find the value of $S_1 +S_2 +S_3 -S$." Prove that each student would obtain the same result . [img]https://1.bp.blogspot.com/-K3kHWWWgxgU/XWHRQ8WqqPI/AAAAAAAAKjE/0iO4-Yz6p9AcM2mklprX_M18xTyg9O81gCK4BGAYYCw/s200/TOT%2B1985%2BAutumn%2BJ3.png[/img] ( A . K . Tolpygo, Kiev)

Let $X$ be set with $n{}$ elements, $n\in\mathbb{N}$. Find the greatest integer $m$ $(m\geq2)$ for which there exist $m$ subsets of $X$ such that each two of them are not disjoint.

Inscribe three mutually tangent pink disks of radii $450$, $450$, and $720$ in an uncolored circle $\Omega$ of radius $1200$. In one move, Elmo selects an uncolored region inside $\Omega$ and draws in it the largest possible pink disk. Can Elmo ever draw a disk with a radius that is a perfect square of a rational? Proposed by [i]Ritwin Narra[/i]

Let $\Omega_1(O_1, r_1)$ and $\Omega_2(O_2, r_2)$ be two circles that intersect in two points $X, Y$ . Let $A, C$ be the points in which the line $O_1O_2$ cuts the circle $\Omega_1$, and let $B$ be the point in which the circle $\Omega_2$ itnersect the interior of the segment $AC$, and let $M$ be the intersection of the lines $AX$ and $BY$ . Prove that $M$ is the midpoint of the segment $AX$ if and only if $O_1O_2 =\frac12 (r_1 + r_2)$.

Let $\vartriangle ABC$ be an equilateral triangle, and let $M$ and $N$ be points on $AB$ and $AC$, respectively, so that $AN = BM$ and $3MB = AB$. Lines $CM$ and $BN$ intersect at $O$. Find $\angle AOB$.

The Quadrumland map is a 6 × 6 square where each square cell is either a kingdom or a disputed territory. There are 27 kingdoms and 9 disputed territories. Each disputed territory is claimed by those and only those kingdoms that are neighbouring with it (adjacent by an edge or a vertex). Is it possible that for each disputed territory the numbers of claims are different? You can discuss your solutions here