Let $x_1,x_2,\ldots,x_n $ be real numbers, where $n\ge 2$ is a given integer, and let $\lfloor{x_1}\rfloor,\lfloor{x_2}\rfloor,\ldots,\lfloor{x_n}\rfloor $ be a permutation of $1,2,\ldots,n$. Find the maximum and minimum of $\sum\limits_{i=1}^{n-1}\lfloor{x_{i+1}-x_i}\rfloor$ (here $\lfloor x\rfloor $ is the largest integer not greater than $x$).

Find all $(x,y,z) \in {\mathbb{N}}^3$ such that $x^{4}-y^{4}=z^{2}$.

Let $a_1,a_2,\ldots$ be a sequence defined by $a_1=a_2=1$ and $a_{n+2}=a_{n+1}+a_n$ for $n\geq 1$. Find \[\sum_{n=1}^\infty \dfrac{a_n}{4^{n+1}}.\]

Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute $\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.

$239$ wise men stand in a circle near an opaque baobab. The king put on the head of each of these wise men a hat og one of $16$ colors. Each wise men does nor know the color of his hat and can only see the two nearest wise men on each side around the circle. Without communicating, these wise men must at the same time make a guess about the color of their hat $($i.e, tell one color$)$. These wise men were allowed to consult in advance, while they are afraid of being too lucky. What is the maximum $k$ for which, in any arrangement of hats, they can certainly ensure that no more than $k$ wise men guess the color of their hats$?$

For an arbitrary square matrix $M$, define $$\exp(M)=I+\frac M{1!}+\frac{M^2}{2!}+\frac{M^3}{3!}+\ldots.$$Construct $2\times2$ matrices $A$ and $B$ such that $\exp(A+B)\ne\exp(A)\exp(B)$.

Let $p>5$ be a prime number and $A=\{b_1,b_2,\dots,b_{\frac{p-1}{2}}\}$ be the set of all quadratic residues modulo $p$, excluding zero. Prove that there doesn't exist any natural $a,c$ satisfying $(ac,p)=1$ such that set $B=\{ab_1+c,ab_2+c,\dots,ab_{\frac{p-1}{2}}+c\}$ and set $A$ are disjoint modulo $p$. [i]This problem was proposed by Amir Hossein Pooya.[/i]

The incircle $\omega$ of triangle $ABC$ touches $BC, CA, AB$ at points $A_1, B_1$ and $C_1$ respectively, $P$ is an arbitrary point on $\omega$. The line $AP$ meets the circumcircle of triangle $AB_1C_1$ for the second time at point $A_2$. Points $B_2$ and $C_2$ are defined similarly. Prove that the circumcircle of triangle $A_2B_2C_2$ touches $\omega$.

In convex pentagon $ ABCDE$, denote by $ AD\cap BE = F,BE\cap CA = G,CA\cap DB = H,DB\cap EC = I,EC\cap AD = J; AI\cap BE = A',BJ%Error. "capCA" is a bad command. = B',CF%Error. "capDB" is a bad command. = C',DG\cap EC = D',EH\cap AD = E'.$ Prove that $ \frac {AB'}{B'C}\cdot\frac {CD'}{D'E}\cdot\frac {EA'}{A'B}\cdot\frac {BC'}{C'D}\cdot\frac {DE'}{E'A} = 1$.

Let $ABC$ be a triangle in which the length of side $AB$ is $4$ units, and that of $BC$ is $2$ units. Let $D$ be the point on $AB$ at distance $3$ units from $A$. Prove that the line perpendicular to $AB$ through $D$, the angle bisector of $\angle ABC$, and the perpendicular bisector of $BC$ all meet at a single point.

Given a $2023 \times 2023$ square grid, there are beetles on some of the unit squares, with at most one beetle on each unit square. In the first minute, every beetle will move one step to its right or left adjacent square. In the second minute, every beetle will move again, only this time, in case the beetle moved right or left in the previous minute, it moves to top or bottom in this minute, and vice versa, and so on. What is the minimum number of beetles on the square grid to ensure that, no matter where the beetles are initially, and how they move in the first minute, but after finitely many minutes, at least two beetles will meet at a certain unit square.

[b]Problem 1 [/b] Let $A$ and $B$ be two $3 \times 3$ matrices with real entries. Prove that $$ A-(A^{-1} +(B^{-1}-A)^{-1})^{-1} =ABA\ , $$ provided all the inverses appearing on the left-hand side of the equality exist.

On the table, there're $1000$ cards arranged on a circle. On each card, a positive integer was written so that all $1000$ numbers are distinct. First, Vasya selects one of the card, remove it from the circle, and do the following operation: If on the last card taken out was written positive integer $k$, count the $k^{th}$ clockwise card not removed, from that position, then remove it and repeat the operation. This continues until only one card left on the table. Is it possible that, initially, there's a card $A$ such that, no matter what other card Vasya selects as first card, the one that left is always card $A$?

Three spheres are all externally tangent to a plane and to each other. Suppose that the radii of these spheres are $6$, $8$, and, $10$. The tangency points of these spheres with the plane form the vertices of a triangle. Determine the largest integer that is smaller than the perimeter of this triangle.

Suppose that ${f: \Bbb{R} \rightarrow \Bbb{R}}$ is an additive function $($that is ${f(x+y) = f(x)+f(y)}$ for all ${x, y \in \Bbb{R}})$ for which ${x \mapsto f(x)f(\sqrt{1-x^2})}$ is bounded of some nonempty subinterval of ${(0,1)}$. Prove that ${f}$ is continuous. [i]Proposed by Zoltán Boros[/i]

Let $x$- minimal root of equation $x^2-4x+2=0$. Find two first digits of number $ \{x+x^2+....+x^{20} \}$ after $0$, where $\{a\}$- fractional part of $a$.

Regular $2n$-gon is inscribed in the unit circle. Find the sum of the squares of all sides and diagonal lengths in the $2n$-gon.

Let $S$ be the set of integers from $1$ to $13$ inclusive. A permutation of $S$ is a function $f : S \to S$ such that $f(x) \ne f(y)$ if $x \ne y$. For how many distinct permutations $f$ does there exists an $n $ such that $f^n(i) = 13 - i + 1$ for all $i$.

The diagram below shows the first three figures of a sequence of figures. The first figure shows an equilateral triangle $ABC$ with side length $1$. The leading edge of the triangle going in a clockwise direction around $A$ is labeled $\overline{AB}$ and is darkened in on the figure. The second figure shows the same equilateral triangle with a square with side length $1$ attached to the leading clockwise edge of the triangle. The third figure shows the same triangle and square with a regular pentagon with side length $1$ attached to the leading clockwise edge of the square. The fourth figure in the sequence will be formed by attaching a regular hexagon with side length $1$ to the leading clockwise edge of the pentagon. The hexagon will overlap the triangle. Continue this sequence through the eighth figure. After attaching the last regular figure (a regular decagon), its leading clockwise edge will form an angle of less than $180^\circ$ with the side $\overline{AC}$ of the equilateral triangle. The degree measure of that angle can be written in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(250); defaultpen(linewidth(0.7)+fontsize(10)); pair x[],y[],z[]; x[0]=origin; x[1]=(5,0); x[2]=rotate(60,x[0])*x[1]; draw(x[0]--x[1]--x[2]--cycle); for(int i=0;i<=2;i=i+1) { y[i]=x[i]+(15,0); } y[3]=rotate(90,y[0])*y[2]; y[4]=rotate(-90,y[2])*y[0]; draw(y[0]--y[1]--y[2]--y[0]--y[3]--y[4]--y[2]); for(int i=0;i<=4;i=i+1) { z[i]=y[i]+(15,0); } z[5]=rotate(108,z[4])*z[2]; z[6]=rotate(108,z[5])*z[4]; z[7]=rotate(108,z[6])*z[5]; draw(z[0]--z[1]--z[2]--z[0]--z[3]--z[4]--z[2]--z[7]--z[6]--z[5]--z[4]); dot(x[2]^^y[2]^^z[2],linewidth(3)); draw(x[2]--x[0]^^y[2]--y[4]^^z[2]--z[7],linewidth(1)); label("A",(x[2].x,x[2].y-.3),S); label("B",origin,S); label("C",x[1],S);[/asy]

A line $l$ is drawn through the intersection point $H$ of altitudes of acute-angle triangles. Prove that symmetric images $l_a, l_b, l_c$ of $l$ with respect to the sides $BC,CA,AB$ have one point in common, which lies on the circumcircle of $ABC.$

Prove that $f(2) \ge 3^n$ where the polynomial $f(x) = x_n + a_1x_{n-1} + ...+ a_{n-1}x + 1$ has non-negative coefficients and $n$ real roots.

Let $x$, $y$, $z$ be positive real numbers satisfying $x+y+z\ge 6$. Find, with proof, the minimum value of \[ x^2+y^2+z^2+\frac{x}{y^2+z+1}+\frac{y}{z^2+x+1}+\frac{z}{x^2+y+1}. \]

On Day $1$, Alice starts with the number $a_1=5$. For all positive integers $n>1$, on Day $n$, Alice randomly selects a positive integer $a_n$ between $a_{n-1}$ and $2a_{n-1}$, inclusive. Given that the probability that all of $a_2,a_3,\ldots,a_7$ are odd can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, compute $m+n$. [i]2021 CCA Math Bonanza Lightning Round #1.4[/i]

Decide whether there exist infinitely many triples $(a,b,c)$ of positive integers such that all prime factors of $a!+b!+c!$ are smaller than $2020$. [i]Pitchayut Saengrungkongka, Thailand[/i]

Compute $\sqrt{2022^2-12^6}.$