There are some real numbers on the board (at least two). In every step we choose two of them, for example $a$ and $b$, and then we replace them with $\frac{ab}{a+b}$. We continue until there is one number. Prove that the last number does not depend on which order we choose the numbers to erase.

In a parallelogram $ABCD$, triangle $ABD$ is acute-angled and $\angle BAD = \pi /4$. Consider all possible choices of points $K,L,M,N$ on sides $AB,BC, CD,DA$ respectively, such that $KLMN$ is a cyclic quadrilateral whose circumradius equals those of triangles $ANK$ and $CLM$. Find the locus of the intersection of the diagonals of $KLMN$

Let $\left(a_{1},\ a_{2},\ a_{3},\ ...\right)$ be a sequence of reals such that $a_{n}\geq\frac{\left(n-1\right)a_{n-1}+\left(n-2\right)a_{n-2}+...+2a_{2}+1a_{1}}{\left(n-1\right)+\left(n-2\right)+...+2+1}$ for every integer $n\geq 2$. Prove that $a_{n}\geq\frac{a_{n-1}+a_{n-2}+...+a_{2}+a_{1}}{n-1}$ for every integer $n\geq 2$. [i]Generalization.[/i] Let $\left(b_{1},\ b_{2},\ b_{3},\ ...\right)$ be a monotonically increasing sequence of positive reals, and let $\left(a_{1},\ a_{2},\ a_{3},\ ...\right)$ be a sequence of reals such that $a_{n}\geq\frac{b_{n-1}a_{n-1}+b_{n-2}a_{n-2}+...+b_{2}a_{2}+b_{1}a_{1}}{b_{n-1}+b_{n-2}+...+b_{2}+b_{1}}$ for every integer $n\geq 2$. Prove that $a_{n}\geq\frac{a_{n-1}+a_{n-2}+...+a_{2}+a_{1}}{n-1}$ for every integer $n\geq 2$. darij

One hundred and one beetles are crawling in the plane. Some of the beetles are friends. Every one hundred beetles can position themselves so that two of them are friends if and only if they are at unit distance from each other. Is it always true that all one hundred and one beetles can do the same?

Determine all pairs $(a, b)$ of integers which satisfy the equality $\frac{a + 2}{b + 1} +\frac{a + 1}{b + 2} = 1 +\frac{6}{a + b + 1}$

Let pairwise different positive integers $a,b, c$ with gcd$(a,b,c) = 1$ are such that $a | (b - c)^2, b | (c- a)^2, c | (a - b)^2$. Prove, that there is no non-degenerate triangle with side lengths $a, b$ and $c$.

Let $a, b$ and $n$ be positive integers with $a>b$ such that all of the following hold: i. $a^{2021}$ divides $n$, ii. $b^{2021}$ divides $n$, iii. 2022 divides $a-b$. Prove that there is a subset $T$ of the set of positive divisors of the number $n$ such that the sum of the elements of $T$ is divisible by 2022 but not divisible by $2022^2$. [i]Proposed by Silouanos Brazitikos, Greece[/i]

Let $14$ integer numbers are given. Let Hamza writes on the paper the greatest common divisor for each pair of numbers. It occurs that the difference between the biggest and smallest numbers written on the paper is less than $91$. Prove that not all numbers on the paper are different.

A trawler is about to fish in territorial waters of a neighboring country, for what he has no licence. Whenever he throws the net, the coast-guard may stop him with the probability $1/k$, where $k$ is a fixed positive integer. Each throw brings him a fish landing of a fixed weight. However, if the coast-guard stops him, they will confiscate his entire fish landing and demand him to leave the country. The trawler plans to throw the net $n$ times before he returns to territorial waters in his country. Find $n$ for which his expected profit is maximal.

How many ways can you mark $8$ squares of an $8\times 8$ chessboard so that no two marked squares are in the same row or column, and none of the four corner squares is marked? (Rotations and reflections are considered different.)

Evaluate $\displaystyle\sum_{n=1}^\infty \dfrac{1}{n\cdot 2^{n-1}}$.

A square with side $1$ contains a non-self-intersecting polyline of length at least $200$. Prove that there is a straight line parallel to the side of the square that has at least $101$ points in common with this polyline.

Prove that for all $n \ge 3$ there are an infinite number of $n$-sided polygonal numbers which are also the sum of two other (not necessarily different) $n$-sided polygonal numbers! The first $n$-sided polygonal number is $1$. The kth n-sided polygonal number for $k \ge 2$ is the number of different points in a figure that consists of all of the regular $n$-sided polygons which have one common vertex, are oriented in the same direction from that vertex and their sides are $\ell$ cm long where $1 \le \ell \le k - 1$ cm and $\ell$ is an integer. [i]In this figure, what we call points are the vertices of the polygons and the points that break up the sides of the polygons into exactly $1$ cm long segments. For example, the first four pentagonal numbers are 1,5,12, and 22, like it is shown in the figure.[/i] [img]https://cdn.artofproblemsolving.com/attachments/1/4/290745d4be1888813678127e6d63b331adaa3d.png[/img]

Suppose a convex polygon has a perimeter of $1$. Prove that it can be covered with a circle of radius $1/4$.

Joshua's physics teacher, Dr. Lisi, lives next door to the Kubiks and is a long time friend of the family. An unusual fellow, Dr. Lisi spends as much time surfing and raising chickens as he does trying to map out a $\textit{Theory of Everything}$. Dr. Lisi often poses problems to the Kubik children to challenge them to think a little deeper about math and science. One day while discussing sequences with Joshua, Dr. Lisi writes out the first $2008$ terms of an arithmetic progression that begins $-1776,-1765,-1754,\ldots.$ Joshua then computes the (positive) difference between the $1980^\text{th}$ term in the sequence, and the $1977^\text{th}$ term in the sequence. What number does Joshua compute?

A point $O$ is choosen inside a triangle $ABC$ so that the length of segments $OA$, $OB$ and $OC$ are equal to $15$,$12$ and $20$, respectively. It is known that the feet of the perpendiculars from $O$ to the sides of the triangle $ABC$ are the vertices of an equilateral triangle. Find the value of the angle $BAC$.

Let $D$ be the foot of the $A$-altitude of an acute triangle $ABC$. The internal bisector of the angle $DAC$ intersects $BC$ at $K$. Let $L$ be the projection of $K$ onto $AC$. Let $M$ be the intersection point of $BL$ and $AD$. Let $P$ be the intersection point of $MC$ and $DL$. Prove that $PK \perp AB$.

Circle $k$ passes through $A$ and intersects the sides of $\Delta ABC$ in $P,Q$, and $L$. Prove that: $\frac{S_{PQL}}{S_{ABC}}\leq \frac{1}{4} (\frac{PL}{AQ})^2$.

$2020$ magicians are divided into groups of $2$ for the Lexington Magic Tournament. After every $5$ days, which is the duration of one match, teams are rearranged so no $2$ people are ever on the same team. If the longest tournament is $n$ days long, what is the value of $n?$ [i]Proposed by Ephram Chun[/i]

Given: $ x > 0, y > 0, x > y$ and $ z\not \equal{} 0$. The inequality which is not always correct is: $ \textbf{(A)}\ x \plus{} z > y \plus{} z \qquad\textbf{(B)}\ x \minus{} z > y \minus{} z \qquad\textbf{(C)}\ xz > yz$ $ \textbf{(D)}\ \frac {x}{z^2} > \frac {y}{z^2} \qquad\textbf{(E)}\ xz^2 > yz^2$

Each coefficient $a_n$ of the power series \[a_0 + a_1 x + a_2 x^2 + a_3 x^3 + \cdots = f(x)\] has either the value of $1$ or the value $0.$ Prove the easier of the two assertions: (i) If $f(0.5)$ is a rational number, $f(x)$ is a rational function. (ii) If $f(0.5)$ is not a rational number, $f(x)$ is not a rational function.

To celebrate the 20th Thailand Mathematical Olympiad (TMO), Ratchasima Witthayalai School put up flags around the Thao Suranari Monument so that [list=i] [*] Each flag is painted in exactly one color, and at least $2$ distinct colors are used. [*] The number of flags are odd. [*] Every flags are on a regular polygon such that each vertex has one flag. [*] Every flags with the same color are on a regular polygon. [/list] Prove that there are at least $3$ colors with the same amount of flags.

A mass is attached to the wall by a spring of constant $k$. When the spring is at its natural length, the mass is given a certain initial velocity, resulting in oscillations of amplitude $A$. If the spring is replaced by a spring of constant $2k$, and the mass is given the same initial velocity, what is the amplitude of the resulting oscillation? (a) $\frac{1}{2}A$ (b) $\frac{1}{\sqrt{2}}A$ (c) $\sqrt{2}A$ (d) $2A$ (e) $4A$

For two positive integers $n$ and $d$, let $S_n(d)$ be the set of all ordered $d$-tuples $(x_1,x_2,\dots ,x_d)$ that satisfy all of the following conditions: i. $x_i\in \{1,2,\dots ,n\}$ for every $i\in\{1,2,\dots ,d\}$; ii. $x_i\ne x_{i+1}$ for every $i\in\{1,2,\dots ,d-1\}$; iii. There does not exist $i,j,k,l\in\{1,2,\dots ,d\}$ such that $i<j<k<l$ and $x_i=x_k,\, x_j=x_l$; a. Compute $|S_3(5)|$ b. Prove that $|S_n(d)|>0$ if and only if $d\leq 2n-1$.

Sequence $a_1, a_2, a_3, \cdots$ satisfies the following condition. [b](Condition)[/b] For all positive integer $n$, $\sum_{k=1}^{n}\frac{1}{2}\left(1 - (-1)^{\left[\frac{n}{k}\right]}\right)a_k=1$ holds. For a positive integer $m = 1001 \cdot 2^{2025}$, compute $a_m$.