In a garden there is an $L$-shaped fence, see figure. You also have at your disposal two finished straight fence sections that are $13$ m and $14$ m long respectively. From point $A$ you want to delimit a part of the garden with an area of at least $200$ m$^2$ . Is it possible to do this? [img]https://1.bp.blogspot.com/-VLWIImY7HBA/X0yZq5BrkTI/AAAAAAAAMbg/8CyP6DzfZTE5iX01Qab3HVrTmaUQ7PvcwCK4BGAYYCw/s400/sweden%2B16p1.png[/img]

$D, \: E , \: F$ are points on the sides $AB, \: BC, \: CA,$ respectively, of a triangle $ABC$ such that $AD=AF, \: BD=BE,$ and $DE=DF.$ Let $I$ be the incenter of the triangle $ABC,$ and let $K$ be the point of intersection of the line $BI$ and the tangent line through $A$ to the circumcircle of the triangle $ABI.$ Show that $AK=EK$ if $AK=AD.$

There is a set with three elements: (2,3,5). It has got an interesting property: (2*3) mod 5=(2*5) mod 3=(3*5) mod 2. Prove that it is the only one set with such property.

Let $n$ be the number of points $P$ interior to the region bounded by a circle with radius $1$, such that the sum of the squares of the distances from $P$ to the endpoints of a given diameter is $3$. Then $n$ is: $\textbf{(A) }0\qquad \textbf{(B) }1\qquad \textbf{(C) }2\qquad \textbf{(D) }4\qquad \textbf{(E) }\text{infinite}$

Oleksii and Solomiya play the following game on a square $6n\times 6n$, where $n$ is a positive integer. Oleksii in his turn places a piece of type $F$, consisting of three cells, on the board. Solomia, in turn, after each move of Oleksii, places the numbers $0, 1, 2$ in the cells of the figure that Oleksii has just placed, using each of the numbers exactly once. If two of Oleksii's pieces intersect at any moment (have a common square), he immediately loses. Once the square is completely filled with numbers, the game stops. In this case, if the sum of the numbers in each row and each column is divisible by $3$, Solomiya wins, and otherwise Oleksii wins. Who can win this game if the figure of type $F$ is: a) a rectangle ; b) a corner of three cells? [i]Proposed by Oleksii Masalitin[/i]

Find all functions $f : \mathbb{Q} \to \mathbb{R}$ such that $f(x)f(y)f(x+y) = f(xy)(f(x) + f(y))$ for all $x,y\in\mathbb{Q}$. [i]Sammy Luo and Alex Zhu.[/i]

Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a [i]saddle pair[/i] if the following two conditions are satisfied: [list] [*] $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$; [*] $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$. [/list] A saddle pair $(R, C)$ is called a [i]minimal pair[/i] if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.

Let ABCD is a cyclic quadrilateral inscribed in $(O)$. $E, F$ are the midpoints of arcs $AB$ and $CD$ not containing the other vertices of the quadrilateral. The line passing through $E, F$ and parallel to the diagonals of $ABCD$ meet at $E, F, K, L$. Prove that $KL$ passes through $O$.

There was a rook at some square of a $10 \times 10{}$ chessboard. At each turn it moved to a square adjacent by side. It visited each square exactly once. Prove that for each main diagonal (the diagonal between the corners of the board) the following statement is true: in the rook’s path there were two consecutive steps at which the rook first stepped away from the diagonal and then returned back to the diagonal. [i]Alexandr Gribalko[/i]

Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.

Let $I$ be the center of a circle inscribed in triangle $ABC$. The circle circumscribed about the triangle $BIC$ intersects lines $AB$ and $AC$ at points $E$ and $F$, respectively. Prove that the line $EF$ touches the circle inscribed in the triangle $ABC$.

Around a circle, $20$ distinct positive integers are written. Alex divides each number by its neighbor, moving clockwise around the circle, and records the remainders obtained in each case. Teo performs a similar process but moves counterclockwise around the circle and records the remainders he obtains. If Alex finds only two distinct remainders among the $20$ he records, determine the number of distinct remainders Teo will record.

Let $F$ be a field whose characteristic is not $2$, let $F^*=F\setminus\left\{0\right\}$ be its multiplicative group and let $T$ be the subgroup of $F^*$ constituted by its finite order elements. Prove that if $T$ is finite, then $T$ is cyclic and its order is even.

The tetrahedron $SABC$ has the following property: there exist five spheres, each tangent to the edges $SA, SB, SC, BC, CA, AB,$ or to their extensions. a) Prove that the tetrahedron $SABC$ is regular. b) Prove conversely that for every regular tetrahedron five such spheres exist.

We write one of the numbers $0$ and $1$ into each unit square of a chessboard with $40$ rows and $7$ columns. If any two rows have different sequences, at most how many $1$s can be written into the unit squares? $ \textbf{(A)}\ 198 \qquad\textbf{(B)}\ 128 \qquad\textbf{(C)}\ 82 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ \text{None of above} $

Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column. What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?

Let $ABCD$ be a convex cyclic quadrilateral with diagonals $AC$ and $BD$. Each of the four vertixes are reflected across the diagonal on which the do not lie. (a) Investigate when the four points thus obtained lie on a straight line and give as simple an equivalent condition as possible to the cyclic quadrilateral $ABCD$ for it. (b) Show that in all other cases the four points thus obtained lie on one circle. (Theresia Eisenkölbl)

Two circles \(\Gamma\) and \(\Sigma\) intersect at two distinct points \(A\) and \(B\). A line through \(B\) intersects \(\Gamma\) and \(\Sigma\) again at \(C\) and \(D\), respectively. Suppose that \(CA=CD\). Show that the centre of \(\Sigma\) lies on \(\Gamma\).

Consider a $m*n$ board. On each box there's a non-negative integrer number assigned. An operation consists on choosing any two boxes with $1$ side in common, and add to this $2$ numbers the same integrer number (it can be negative), so that both results are non-negatives. What conditions must be satisfied initially on the assignment of the boxes, in order to have, after some operations, the number $0$ on every box?.

A line passing through the center $M$ of the equilateral triangle $ABC$ intersects sides $BC$ and $CA$, respectively, in points $D$ and $E$. Circumcircles of triangle $AEM$ and $BDM$ intersects, besides point $M$, also at point $P$. Prove that the center of circumcircle of triangle $DEP$ lies on the perpendicular bisector of the segment $AB$.

Cookie Monster says a positive integer $n$ is $crunchy$ if there exist $2n$ real numbers $x_1,x_2,\ldots,x_{2n}$, not all equal, such that the sum of any $n$ of the $x_i$'s is equal to the product of the other $n$ of the $x_i$'s. Help Cookie Monster determine all crunchy integers. [i]Yannick Yao[/i]

Let $\Omega$ be a circle in a plane. $2022$ pink points and $2565$ blue points are placed inside $\Omega$ such that no point has two colors and no two points are collinear with the center of $\Omega$. Prove that there exists a sector of $\Omega$ such that the angle at the center is acute and the number of blue points inside the sector is greater than the number of pink points by exactly $100$. (Note: such sector may contain no pink points.)

For what value of $ n$ is $ i\plus{}2i^2\plus{}3i^3\plus{}\cdots\plus{}ni^n\equal{}48\plus{}49i$? Note: here $ i\equal{}\sqrt{\minus{}1}$. $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 48 \qquad \textbf{(C)}\ 49 \qquad \textbf{(D)}\ 97 \qquad \textbf{(E)}\ 98$

A rabbit, a skunk and a turtle are running a race. The skunk finishes the race in 6 minutes. The rabbit runs 3 times as quickly as the skunk. The rabbit runs 5 times as quickly as the turtle. How long does the turtle take to finish the race?

Prove that every positive rational number can be expressed uniquely as a finite sum of the form $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+\dots+\frac{a_n}{n!},$$ where $a_n$ are integers such that $0 \leq a_n \leq n-1$ for all $n > 1$.