[b]8.[/b] Let $f$ be a bounded real function defined on the unit cube $H$ of the $n$-dimensional space and, for a given $y$, let $A_y$ and $B_y$ denote the parts of the interior of $H$ on which $f>y$ and $f<y$, respectively. Show that $f$ is integrable in the Riemannian sense if and only if for every $y$ almost all points of $A_y$ and $B_y$ are inner points. [b](R. 9)[/b]

Let $ E$ be the set of all real functions on $ I\equal{}[0,1]$. Prove that one cannot define a topology on $ E$ in which $ f_n\rightarrow f$ holds if and only if $ f_n$ converges to $ f$ almost everywhere.

There is a finite set of points in the plane, where each point is painted in any of $ n $ different colors $ (n \ge 4) $. It is known that there is at least one point of each color and that the distance between any pair of different colored points is less than or equal a 1. Prove that it is possible to choose 3 colors so that, by removing all points of those colors, the remaining set of points can be covered with a radius circle $ \frac {1} {\sqrt {3}} $.

The number of real values of $ x$ satisfying the equation $ 2^{2x^2 \minus{} 7x \plus{} 5} \equal{} 1$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \text{more than 4}$

Let $ab$ be a two digit number. A positive integer $n$ is a [i]relative[/i] of $ab$ if: [list] [*] The units digit of $n$ is $b$. [*] The remaining digits of $n$ are nonzero and add up to $a$.[/list] Find all two digit numbers which divide all of their relatives.

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. A circle $\Gamma$ is internally tangent to $\omega$ at $A$ and also tangent to $BC$ at $D$. Let $AB$ and $AC$ intersect $\Gamma$ at $P$ and $Q$ respectively. Let $M$ and $N$ be points on line $BC$ such that $B$ is the midpoint of $DM$ and $C$ is the midpoint of $DN$. Lines $MP$ and $NQ$ meet at $K$ and intersect $\Gamma$ again at $I$ and $J$ respectively. The ray $KA$ meets the circumcircle of triangle $IJK$ again at $X\neq K$. Prove that $\angle BXP = \angle CXQ$. [i]Kian Moshiri, United Kingdom[/i]

A function $f:[0,\infty)\to[0,\infty)$ is integrable and $$\int_0^\infty f(x)^2 dx<\infty,\quad \int_0^\infty xf(x) dx <\infty$$ Prove the following inequality. $$\left(\int_0^\infty f(x) dx \right)^3 \leq 8\left(\int_0^\infty f(x)^2 dx \right) \left(\int_0^\infty xf(x) dx \right)$$

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$ over the integers for every $i$.

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $n\geq 2$ be an integer. Consider the solutions of the system $$\begin{cases} n=a+b-c \\ n=a^2+b^2-c^2 \end{cases}$$ where $a,b,c$ are integers. Show that there is at least one solution and that the solutions are finitely many.

The [i]Cantor set[/i] is defined as the set of real numbers $x$ such that $0 \le x < 1$ and the digit $1$ does not appear in the base-$3$ expansion of $x.$ Two numbers are uniformly and independently selected at random from the Cantor set. Compute the expected value of their difference. (Formally, one can pick a number $x$ uniformly at random from the Cantor set by first picking a real number $y$ uniformly at random from the interval $[0, 1)$, writing it out in binary, reading its digits as if they were in base-$3,$ and setting $x$ to $2$ times the result.)

For every positive integer $ n$ consider \[ A_n\equal{}\sqrt{49n^2\plus{}0,35n}. \] (a) Find the first three digits after decimal point of $ A_1$. (b) Prove that the first three digits after decimal point of $ A_n$ and $ A_1$ are the same, for every $ n$.

The trapezoid is composed of three conguent right isosceles triangles as shown in the figure. It is necessary to cut it into $4$ equal parts. How to do it? [img]https://cdn.artofproblemsolving.com/attachments/f/e/87b07ae823190f26b70bfa22824679a829e649.png[/img]

A [i]hedgehog[/i] is a circle without its boundaries. The diameter of the hedgehog is the diameter of the corresponding circle. We say that the hedgehog sits at the at the point where the center of the circle is located. We are given a triangle with sides $a, b, c$, with hedgehogs sitting at its vertices. It is known that inside the triangle there is a point from which you can reach any side of the triangle by walking along a straight line without hitting any hedgehog. What is the largest possible sum of the diameters of these hedgehogs? [i]Proposed by Oleksiy Masalitin[/i]

A square array of dots with $7$ rows and $7$ columns is given. Each dot is colored either blue or red. Whenever two dots of the same color are adjacent in the same row or column, they are joined by a line segment of the same color as the dots. If they are adjacent but of difference colors, they are then joined by a purple line segment. There are $20$ red line segments and $19$ blue line segments. Find the positive difference between the maximum and minimum number of red dots. [asy] size(4cm); for (int i = 0; i <= 7; ++i) { for (int j = 0; j <= 7; ++j) { dot((i,j)); } } [/asy] $ \mathrm{(A) \ } 4 \qquad \mathrm{(B) \ } 5 \qquad \mathrm {(C) \ } 6 \qquad \mathrm{(D) \ } 7 \qquad \mathrm{(E) \ } 8$

Four rays spread out from point $O$ in a $3$-dimensional space in a way that the angle between every two rays is $a$. Find $\cos a$.

Given that $a_1, a_2, \dots, a_{10}$ are positive real numbers, determine the smallest possible value of \[\sum \limits_{i = 1}^{10} \left\lfloor \frac{7a_i}{a_i+a_{i+1}}\right\rfloor\] where we define $a_{11} = a_1$. [i]Proposed by Sutanay Bhattacharya[/i]

Find all integer solutions of the equation $xy+5x-3y=27$.

A wobbly number is a positive integer whose digits are alternately zero and non-zero with the last digit non-zero (for example, 201). Find all positive integers which do not divide any wobbly number.

On every square of a chessboard, there are as many grains as shown on the picture. Starting from an arbitrary square, a knight starts a journey over the chessboard. After every move it eats up all the grains from the square it arrived to, but when it leaves, the same number of grains is put back on the square. After some time the knight returns to its initial square. Prove that the total number of grains the knight has eaten up during the journey is divisible by $3$. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZC8xL2IwOGZlODYxMDg1MWMwMWUwMjFkOGJkMWQ2MjA4YzIzZmQ5YTc5LnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNC0yOCBhdCA3LjIzLjA3IEFNLnBuZw==[/img]

$\boxed{A6}$The sequence $a_0,a_1,...$ is defined by the initial conditions $a_0=1,a_1=6$ and the recursion $a_{n+1}=4a_n-a_{n-1}+2$ for $n>1.$Prove that $a_{2^k-1}$ has at least three prime factors for every positive integer $k>3.$

Consider a real number $a$ that satisfies $a=(a-1)^3$. Prove that there exists an integer $N$ that satisfies $$|a^{2021}-N|<2^{-1000}.$$ [i] (Vlad Robu) [/i]

Let $x$ be a non-zero real numbers such that $x^4+\frac{1}{x^4}$ and $x^5+\frac{1}{x^5}$ are both rational numbers. Prove that $x+\frac{1}{x}$ is a rational number.

Two branches of the hyperbola $xy=1$ are $C_1,C_2$ ($C_1$ in Quadrant I, $C_2$ in Quadrant III). Three apexes of regular triangle $PQR$ are on the hyperbola. [b](a)[/b] $P,Q,R$ cannot be on the same branch. [b](b)[/b] $P(-1,-1)$ is a point on $C_2$, if $Q,R$ are on $C_1$, find their coordinates.

Nashan randomly chooses $6$ positive integers $a, b, c, d, e, f$. Find the probability that $2^a+2^b+2^c+2^d+2^e+2^f$ is divisible by $5$. [i]Proposed by Bradley Guo[/i]