Given trapezoid $ ABCD$ with parallel sides $ AB$ and $ CD$, assume that there exist points $ E$ on line $ BC$ outside segment $ BC$, and $ F$ inside segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Denote by $ I$ the point of intersection of $ CD$ and $ EF$, and by $ J$ the point of intersection of $ AB$ and $ EF$. Let $ K$ be the midpoint of segment $ EF$, assume it does not lie on line $ AB$. Prove that $ I$ belongs to the circumcircle of $ ABK$ if and only if $ K$ belongs to the circumcircle of $ CDJ$. [i]Proposed by Charles Leytem, Luxembourg[/i]

Consider circle inscribed quadriateral $ABCD$. Let $M,N,P,Q$ be midpoints of sides $DA,AB,BC,CD$.Let $E$ be the point of intersection of diagonals. Let $k1,k2$ be circles around $EMN$ and $EPQ$ . Let $F$ be point of intersection of $k1$ and $k2$ different from $E$. Prove that $EF$ is perpendicular to $AC$.

Let $p$ be a prime. We say that a sequence of integers $\{z_n\}_{n=0}^\infty$ is a [i]$p$-pod[/i] if for each $e \geq 0$, there is an $N \geq 0$ such that whenever $m \geq N$, $p^e$ divides the sum \[\sum_{k=0}^m (-1)^k {m \choose k} z_k.\] Prove that if both sequences $\{x_n\}_{n=0}^\infty$ and $\{y_n\}_{n=0}^\infty$ are $p$-pods, then the sequence $\{x_ny_n\}_{n=0}^\infty$ is a $p$-pod.

Prove that $N^2$ arbitrary distinct positive integers ($N>10$) can be arranged in a $N\times N$ table, so that all $2N$ sums in rows and columns are distinct. [i]Proposed by S. Volchenkov[/i]

For any finite sequence of positive integers $\pi$, let $S(\pi)$ be the number of strictly increasing sub sequences in $\pi$ with length $2$ or more. For example, in the sequence $\pi = \{3, 1, 2, 4\}$, there are five increasing sub-sequences: $\{3, 4\}$, $\{1, 2\}$, $\{1, 4\}$, $\{2, 4\}$, and \${1, 2, 4\}, so $S(\pi) = 5$. In an eight-player game of Fish, Joy is dealt six cards of distinct values, which she puts in a random order $\pi$ from left to right in her hand. Determine $$\sum_{\pi} S(\pi),$$ where the sum is taken over all possible orders $\pi$ of the card values.

A circle of radius $2$ is inscribed in equilateral triangle $ABC$. The altitude from $A$ to $BC$ intersects the circle at a point $D$ not on $BC$. $BD$ intersects the circle at a point $E$ distinct from $D$. Find the length of $BE$.

Amelia’s mother proposes a game. “Pick two of the shapes below,” she says to Amelia. (The shapes are an equilateral triangle, a parallelogram, an isosceles trapezoid, a kite, and an ellipse. These shapes are drawn to scale.) Amelia’s mother continues: “I will draw those two shapes on a sheet of paper, in whatever position and orientation I choose, without overlapping them. Then you draw a straight line that cuts both shapes, so that each shape is divided into two congruent halves.” [img]https://cdn.artofproblemsolving.com/attachments/e/7/c3dfe1e528d7be431b8afcc187b65b0c8f04fd.png[/img] Which two of the shapes should Amelia choose to guarantee that she can succeed? Given that choice of shapes, explain how Amelia can draw her line, what property of those shapes makes it possible for her to do so, and why this would not work with any other pair of these shapes.

A set $A_1 , A_2 , A_3 , A_4$ of 4 points in the plane is said to be [i]Athenian[/i] set if there is a point $P$ of the plane satsifying (*) $P$ does not lie on any of the lines $A_i A_j$ for $1 \leq i < j \leq 4$; (**) the line joining $P$ to the mid-point of the line $A_i A_j$ is perpendicular to the line joining $P$ to the mid-point of $A_k A_l$, $i,j,k,l$ being distinct. (a) Find all [i]Athenian[/i] sets in the plane. (b) For a given [i]Athenian[/i] set, find the set of all points $P$ in the plane satisfying (*) and (**)

In triangle $ABC$, let $M$ be the midpoint of $BC$, $H$ be the orthocenter, and $O$ be the circumcenter. Let $N$ be the reflection of $M$ over $H$. Suppose that $OA = ON = 11$ and $OH = 7.$ Compute $BC^2$.

The sum of $2025$ non-negative real numbers is $1$. Prove that they can be organized in a circle in such a way that the sum of all the $2025$ products of pairs of neighbouring numbers isn't greater than $\frac{1}{2025}$.

We call the set $A\in \mathbb R^n$ CN if and only if for every continuous $f:A\to A$ there exists some $x\in A$ such that $f(x)=x$. a) Example: We know that $A = \{ x\in\mathbb R^n | |x|\leq 1 \}$ is CN. b) The circle is not CN. Which one of these sets are CN? 1) $A=\{x\in\mathbb R^3| |x|=1\}$ 2) The cross $\{(x,y)\in\mathbb R^2|xy=0,\ |x|+|y|\leq1\}$ 3) Graph of the function $f:[0,1]\to \mathbb R$ defined by \[f(x)=\sin\frac 1x\ \mbox{if}\ x\neq0,\ f(0)=0\]

Let $a,b,c$ be positive real numbers, such that $(ab)^2 + (bc)^2 + (ca)^2 = 3$. Prove that \[ (a^2 - a + 1)(b^2 - b + 1)(c^2 - c + 1) \ge 1. \] [i]Proposed by Florin Stanescu (wer), România[/i]

Let $ABC$ be an acute triangle and $D$ a point on the side $AB$. The circumcircle of triangle $BCD$ cuts the side $AC$ again at $E$ .The circumcircle of triangle $ACD$ cuts the side $BC$ again at $F$. If $O$ is the circumcenter of the triangle $CEF$. Prove that $OD$ is perpendicular to $AB$.

Katherine makes Benj play a game called $50$ Cent. Benj starts with $\$0.50$, and every century thereafter has a $50\%$ chance of doubling his money and a $50\%$ chance of having his money reset to $\$0.50$. What is the expected value of the amount of money Benj will have, in dollars, after $50$ centuries?

Solve the following equation in the set of positive integers $x + y^2 + (GCD(x, y))^2 = xy \cdot GCD(x, y)$.

A marathon runner has a very peculiar way of training for a marathon. On the first day of week $1$, the runner runs a distance equivalent to the first prime number. On the second day, the runner runs a distance equal to the second prime number, continuing this pattern until the $7$th day of the week. Each successive week, the runner runs one more mile per day than they did on the same day of the previous week. The runner continues this process until the average distance run each week exceeds the distance of a marathon ($26.2$ miles). How many weeks does the marathoner train?

The total mass of $100$ given weights with positive masses equals $2S$. A natural number $k$ is called [i]middle[/i] if some $k$ of the given weights have the total mass $S$. Find the maximum possible number of middle numbers.

In $\triangle ABC$ with $AB=AC$,$M$ is the midpoint of $BC$,$H$ is the projection of $M$ onto $AB$ and $D$ is arbitrary point on the side $AC$.Let $E$ be the intersection point of the parallel line through $B$ to $HD$ with the parallel line through $C$ to $AB$.Prove that $DM$ is the bisector of $\angle ADE$.

Baron Munchausen presented a new theorem: if a polynomial $x^{n} - ax^{n-1} + bx^{n-2}+ \dots$ has $n$ positive integer roots then there exist $a$ lines in the plane such that they have exactly $b$ intersection points. Is the baron’s theorem true?

Let $MABCD$ be a pyramid with the square $ABCD$ as the base, in which $MA=MD$, $MA^2+AB^2=MB^2$ and the area of $\triangle ADM$ is equal to $1$. Determine the radius of the largest ball that is contained in the given pyramid.

Two arbitrary distinct lattice points are selected on the coordinate plane within the square marked by the points $(0,0)$, $(3,0)$, $(0,3)$, and $(3,3)$ (the lattice points may lie on a side or a corner of the square). What is the probability that the distance between the two points is at most $\sqrt{2}$?

Let $S$ be the set of positive integers in which the greatest and smallest elements are relatively prime. For natural $n$, let $S_n$ denote the set of natural numbers which can be represented as sum of at most $n$ elements (not necessarily different) from $S$. Let $a$ be greatest element from $S$. Prove that there are positive integer $k$ and integers $b$ such that $|S_n| = a \cdot n + b$ for all $ n > k $.

For every sequence $p_1<p_2<\cdots<p_8$ of eight prime numbers, determine the largest integer $N$ for which the following equation has no solution in positive integers $x_1,\ldots,x_8$: $$p_1\, p_2\, \cdots\, p_8 \left( \frac{x_1}{p_1}+ \frac{x_2}{p_2}+ ~\cdots~ +\frac{x_8}{p_8} \right) ~~=~~ N $$ [i]Proposed by Gerhard Woeginger, Austria[/i]

If $AG_a,BG_b$, and $CG_c$ are symmedians in $\Delta ABC$ ($G_a\in BC,G_b\in AC,G_c\in AB$), is it possible for $\Delta G_a G_b G_c$ to be equilateral when $\Delta ABC$ is not equilateral?

Find the smallest positive integer $N$ for which $N$ is divisible by $19$, and when the digits of $N$ are read in reverse order, the result (after removing any leading zeroes) is divisible by $36$. [i]Proposed by Michael Tang[/i]