A triangle $KLM$ is given in the plane together with a point $A$ lying on the half-line opposite to $KL$. Construct a rectangle $ABCD$ whose vertices $B, C$ and $D$ lie on the lines $KM, KL$ and $LM$, respectively. (We allow the rectangle to be a square.)

Find all functions $ f,g: \mathbb Q \to \mathbb Q$ such that for all rational numbers $ x,y$ we have \[ f(f(x) \plus{} g(y) ) \equal{} g(f(x)) \plus{} y . \]

Triangle $GRT$ has $GR=5,$ $RT=12,$ and $GT=13.$ The perpendicular bisector of $GT$ intersects the extension of $GR$ at $O.$ Find $TO.$

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

A trapezoid $ABCD$ is given where $AB$ and $CD$ are parallel. Let $M$ be the midpoint of the segment $AB$. Point $N$ is located on the segment $CD$ such that $\angle ADN = \frac{1}{2} \angle MNC$ and $\angle BCN = \frac{1}{2} \angle MND$. Prove that $N$ is the midpoint of the segment $CD$. [i]Proposed by Alireza Dadgarnia[/i]

Let $t\in (1,2)$. Show that there exists a polynomial $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ with the coefficients in $\{1,-1\}$ such that $\left|P(t)-2019\right| \leqslant 1.$ [i]Proposed by N. Safaei (Iran)[/i]

For each pair of even natural numbers $ k $, $ m $determine all real numbers $ x $that satisfy the equation $$ (\sin x)^k + (\cos x)^{-m} = (\cos x)^k + (\sin x)^{-m}$$

The following diagram shows a square where each side has seven dots that divide the side into six equal segments. All the line segments that connect these dots that form a $45^{\circ}$ angle with a side of the square are drawn as shown. The area of the shaded region is 75. Find the area of the original square. [center][img]https://i.snag.gy/Jzx9Fn.jpg[/img][/center]

Let $ \mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $ |8 \minus{} x| \plus{} y \le 10$ and $ 3y \minus{} x \ge 15$. When $ \mathcal{R}$ is revolved around the line whose equation is $ 3y \minus{} x \equal{} 15$, the volume of the resulting solid is $ \frac {m\pi}{n\sqrt {p}}$, where $ m$, $ n$, and $ p$ are positive integers, $ m$ and $ n$ are relatively prime, and $ p$ is not divisible by the square of any prime. Find $ m \plus{} n \plus{} p$.

In the diagram below, points $D, E$, and $F$ are on the inside of equilateral $\vartriangle ABC$ such that $D$ is on $\overline{AE}, E$ is on $\overline{CF}, F$ is on $\overline{BD}$, and the triangles $\vartriangle AEC, \vartriangle BDA$, and $\vartriangle CFB$ are congruent. Given that $AB = 10$ and $DE = 6$, the perimeter of $\vartriangle BDA$ is $\frac{a+b\sqrt{c}}{d}$, where $a, b, c$, and $d$ are positive integers, $b$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [img]https://cdn.artofproblemsolving.com/attachments/8/6/98da82fc1c26fa13883a47ba6d45a015622b20.png[/img]

Suppose that the sum of all positive divisors of a natural number $n$, $n$ excluded, plus the number of these divisors is equal to $n$. Prove that $n = 2m^2$ for some integer $m$.

Three different points were randomly selected from the vertices of the regular $2n$-gon. Let $ p_n $ be the probability of the event that the triangle with vertices at the selected points is acute-angled. Calculate $ \lim_{n\to \infty} p_n $. Attention. We assume that all choices of three different points are equally likely.

Five lines go through one point. Prove that there exists a closed five-segment polygonal line, the vertices and the middle of the segments of which lie on these lines, and each line has exactly one vertex.

Let $ABC$ be an acute triangle with $AC> AB$. be $\Gamma$ the circumcircle circumscribed to the triangle $ABC$ and $D$ the midpoint of the smallest arc $BC$ of this circle. Let $E$ and $F$ points of the segments $AB$ and $AC$ respectively such that $AE = AF$. Let $P \neq A$ be the second intersection point of the circumcircle circumscribed to $AEF$ with $\Gamma$. Let $G$ and $H$ be the intersections of lines $PE$ and $PF$ with $\Gamma$ other than $P$, respectively. Let $J$ and $K$ be the intersection points of lines $DG$ and $DH$ with lines $AB$ and $AC$ respectively. Show that the $JK$ line passes through the midpoint of $BC$

Let $n$ be a given integer with $n$ greater than $7$ , and let $\mathcal{P}$ be a convex polygon with $n$ sides. Any set of $n-3$ diagonals of $\mathcal{P}$ that do not intersect in the interior of the polygon determine a triangulation of $\mathcal{P}$ into $n-2$ triangles. A triangle in the triangulation of $\mathcal{P}$ is an interior triangle if all of its sides are diagonals of $\mathcal{P}$. Express, in terms of $n$, the number of triangulations of $\mathcal{P}$ with exactly two interior triangles, in closed form.

Call a subset of the plane a circular set iff there exists a point such that for every ray starting from it, the ray intersects the subset once. show that the plane is a countable union of circular sets. [hide=idea] let H be a transcendence basis of R over Q. let $\{h_1,h_2,...\}$ be a subset of H. let $K_n$ be the field of real numbers that are algebraic over $H\setminus\{h_n\}$. $K_n\times K_n$ can be covered by a circular set $J_n$. $R\times R\subseteq \cup (K_n\times K_n) \subseteq \cup J_n \subseteq R\times R$ the first inclusion proof: x,y algebraically depend on H, so they depend on H', where H' is a finite subset of H. $\exists n$ st $h_n\notin H'$ $(x,y)\in K_n\times K_n$[/hide]

Find all functions $f$ from positive integers to themselves such that: 1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$ 2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.

Prove that there exist $16$ subsets of set $M = \{1,2,...,10000\}$ with the following property: For every $z \in M$ there are eight of these subsets whose intersection is $\{z\}$.

Given real numbers $a_i,b_i~(i=1,2,\ldots,n)$ such that \begin{align*} &a_1\ge a_2\ge\ldots\ge a_n>0,\\ &b_1\ge a_1,\\ &b_1b_2\ge a_1a_2,\\ &\vdots\\ &b_1b_2\cdots b_n\ge a_1a_2\cdots a_n, \end{align*}prove that $b_1+b_2+\ldots+b_n\ge a_1+a_2+\ldots+a_n$.

[asy] draw(unitsquare);draw((0,0)--(.4,1)^^(0,.6)--(1,.2)); label("D",(0,1),NW);label("E",(.4,1),N);label("C",(1,1),NE); label("P",(0,.6),W);label("M",(.25,.55),E);label("Q",(1,.2),E); label("A",(0,0),SW);label("B",(1,0),SE); //Credit to Zimbalono for the diagram[/asy] Inside square $ABCD$ (See figure) with sides of length $12$ inches, segment $AE$ is drawn where $E$ is the point on $DC$ which is $5$ inches from $D$. The perpendicular bisector of $AE$ is drawn and intersects $AE$, $AD$, and $BC$ at points $M$, $P$, and $Q$ respectively. The ratio of segment $PM$ to $MQ$ is $\textbf{(A) }5:12\qquad\textbf{(B) }5:13\qquad\textbf{(C) }5:19\qquad\textbf{(D) }1:4\qquad \textbf{(E) }5:21$

Team $ A$ and team $ B$ play a series. The first team to win three games wins the series. Each team is equally likely to win each game, there are no ties, and the outcomes of the individual games are independent. If team $ B$ wins the second game and team $ A$ wins the series, what is the probability that team $ B$ wins the first game? $ \textbf{(A)}\ \frac{1}{5}\qquad \textbf{(B)}\ \frac{1}{4}\qquad \textbf{(C)}\ \frac{1}{3}\qquad \textbf{(D)}\ \frac{1}{2}\qquad \textbf{(E)}\ \frac{2}{3}$

Let $r$ be a positive integer and let $N$ be the smallest positive integer such that the numbers $\frac{N}{n+r}\binom{2n}{n}$, $n=0,1,2,\ldots $, are all integer. Show that $N=\frac{r}{2}\binom{2r}{r}$.

Show that reducing the dimensions of a cuboid we can't get another cuboid with half the volume and half the surface.

In a concyclic quadrilateral $PQRS$,$\angle PSR=\frac{\pi}{2}$ , $H,K$ are perpendicular foot from $Q$ to sides $PR,RS$ , prove that $HK$ bisect segment$SQ$.

Let $(x_n)_{n\in Z}$ and $(y_n)_{n\in Z}$ be two sequences of integers such that $|x_{n+2} - x_n| \le 2$ and $x_n + x_m = y_{n^2+m^2}$ for all $n, m \in Z$. Show that the sequence of $x_n$s takes at most $6$ distinct values. (Paolo Leonetti)