Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

A polygon with sides running along the sides of the squares was cut out of an endless chessboard. A segment of the perimeter of a polygon is called black if the polygon adjacent to it from the inside is which cell is black, respectively white if the cell is white. Let $A$ be the number of black segments on the perimeter, and $B$ be the number of white ones, Let the polygon consist of $a$ black and $b$ white cells. Prove that $A-B = 4(a -b)$.

The isosceles triangle $\triangle ABC$, with $AB=AC$, is inscribed in the circle $\omega$. Let $P$ be a variable point on the arc $\stackrel{\frown}{BC}$ that does not contain $A$, and let $I_B$ and $I_C$ denote the incenters of triangles $\triangle ABP$ and $\triangle ACP$, respectively. Prove that as $P$ varies, the circumcircle of triangle $\triangle PI_BI_C$ passes through a fixed point.

For each natural number $n\ge3$, let $m(n)$ be the maximum number of points inside or on the sides of a regular $n$-agon of side $1$ such that the distance between any two points is greater than $1$. Prove that $m(n)\ge n$ for $n>6$.

The number $2021 = 43 \cdot 47$ is composite. Prove that if we insert any number of digits “8” between 20 and 21 then the number remains composite. [i]Mikhail Evdikomov[/i]

Let $ a,b,c\in\mathbb{R}_+^*, $ and $ f:[0,a]\longrightarrow [0,b] $ bijective and non-decreasing. Prove that: $$ \frac{1}{b}\int_0^a f^2 (x)dx +\frac{1}{a}\int_0^b \left( f^{-1} (x)\right)^2dx\le ab. $$

An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

In a chess tournament, each of $2n$ players plays every other player once in each of two rounds. A win is worth $1$ point, a draw is worth $\frac12$ point and a loss is worth nothing. Prove that if for every player, the total score in the first round differs from that in the second round by at least n points, then this difference is exactly n points for every player. (B Frenkin)

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

A six-sided die is rolled four times. What is the probability that the minimum value of the four rolls is $4$?

Given is the equation: \[x^2+mx+2022=0\] a) Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{natural}$ numbers b)Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{integer}$ numbers

Given an integer $n \ge 2$, determine the number of ordered $n$-tuples of integers $(a_1, a_2,...,a_n)$ such that (a) $a_1 + a_2 + .. + a_n \ge n^2$ and (b) $a_1^2 + a_2^2 + ... + a_n^2 \le n^3 + 1$

An infinite increasing sequence $a_1 < a_2 < a_3 < \cdots$ of positive integers is called [i]central[/i] if for every positive integer $n$ , the arithmetic mean of the first $a_n$ terms of the sequence is equal to $a_n$. \\Show that there exists an infinite sequence $b_1, b_2, b_3, \dots$ of positive integers such that for every central sequence $a_1, a_2, a_3, \dots, $ there are infinitely many positive integers $n$ with $a_n = b_n$.

The function $\varphi(x,y,z)$ defined for all triples $(x,y,z)$ of real numbers, is such that there are two functions $f$ and $g$ defined for all pairs of real numbers, such that \[\varphi(x,y,z) = f(x+y,z) = g(x,y+z)\] for all real numbers $x,y$ and $z.$ Show that there is a function $h$ of one real variable, such that \[\varphi(x,y,z) = h(x+y+z)\] for all real numbers $x,y$ and $z.$

Find the total number of $k$-tuples $(n_1,n_2,...,n_k)$ of positive integers so that $n_{i+1}\ge n_i$ for each $i$, and $k$ regular polygons with numbers of sides $n_1,n_2,...,n_k$ respectively will fit into a tesselation at a point. That is, the sum of one interior angle from each of the polygons is $360^{\circ}$.

Prove that from any five points in the plane it is possible to choose three points that are not vertices of an acute triangle.

Find the number of ordered pairs of integers $(a, b)$ that satisfy the inequality \[ 1 < a < b+2 < 10. \] [i]Proposed by Lewis Chen [/i]

Find all triples $(x,y, z)$ of real (but not necessarily positive) numbers satisfying $3(x^2 + y^2 + z^2) = 1$ , $x^2y^2 + y^2z^2 + z^2x^2 = xyz(x + y + z)^3$.

Let $G= \{ A \in \mathcal M_2 \left( \mathbb C \right) \mid |\det A| = 1 \}$ and $H =\{A \in \mathcal M_2 \left( \mathbb C \right) \mid \det A = 1 \}$. Prove that $G$ and $H$ together with the operation of matrix multiplication are two non-isomorphical groups.

At CMIMC headquarters, there is a row of $n$ lightbulbs, each of which is connected to a light switch. Daniel the electrician knows that exactly one of the switches doesn't work, and needs to find out which one. Every second, he can do exactly one of 3 things: [list] [*] Flip a switch, changing the lightbulb from off/on or on/off (unless the switch is broken). [*] Check if a given lightbulb is on or off. [*] Measure the total electricity usage of all the lightbulbs, which tells him exactly how many are currently on. [/list] Initially, all the lightbulbs are off. Daniel was given the very difficult task of finding the broken switch in at most $n$ seconds, but fortunately he showed up to work 10 seconds early today. What is the largest possible value $n$ such that he can complete his task on time? [i]Proposed by Adam Bertelli[/i]

Determine whether there exists a function $ f: \mathbb{N}\longrightarrow \mathbb{N}$ such that $ f(n)\equal{}f(f(n\minus{}1))\plus{}f(f(n\plus{}1))$ for all natural numbers $ n\ge 2$.

Let $f(n)=\sum_{k=0}^{2010}n^k$. Show that for any integer $m$ satisfying $2\leqslant m\leqslant 2010$, there exists no natural number $n$ such that $f(n)$ is divisible by $m$. [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 1)[/i]

Prove that for natural number $n$ it's possible to find complex numbers $\omega_1,\omega_2,\cdots,\omega_n$ on the unit circle that $$\left\lvert\sum_{j=1}^{n}\omega_j\right\rvert=\left\lvert\sum_{j=1}^{n}\omega_j^2\right\rvert=n-1$$ iff $n=2$ occurs.

$(CZS 1)$ Given a unit cube, find the locus of the centroids of all tetrahedra whose vertices lie on the sides of the cube.

How many ways are there to cover this region with dominoes? [asy] unitsize(20); int[][] a = { {999, 999, 000, 000, 000, 999, 999, 999}, {999, 999, 000, 888, 000, 999, 999, 999}, {999, 999, 000, 000, 000, 000, 000, 000}, {000, 000, 000, 888, 888, 000, 888, 000}, {000, 888, 000, 888, 888, 000, 000, 000}, {000, 000, 000, 000, 000, 000, 999, 999}, {999, 999, 999, 000, 888, 000, 999, 999}, {999, 999, 999, 000, 000, 000, 999, 999}}; for (int i = 0; i < 8; ++i) { for (int j = 0; j < 8; ++j) { if (a[j][i] != 999) draw((i, -j)--(i+1, -j)--(i+1, -j-1)--(i, -j-1)--cycle); if (a[j][i] == 888) fill((i, -j)--(i+1, -j)--(i+1, -j-1)--(i, -j-1)--cycle); } } [/asy]