Show that there are positive reals $a$, $b$, $c$ such that \[\left\{ \begin{array}{l} a^2 + b^2 + c^2 > 2 \\ a^3 + b^3 + c^3 <2 \\ a^4 + b^4 + c^4 > 2 \\ \end{array} \right. \]

Arpon chooses a positive real number $k$. For each positive integer $n$, he places a marker at the point $(n,nk)$ in the $(x,y)$ plane. Suppose that two markers whose $x$-coordinates differ by $4$ have distance $31$. What is the distance between the markers $(7,7k)$ and $(19,19k)$?

The incentre of a triangle is joined by three segments to the three vertices of the triangle, thereby dividing it into three smaller triangles. If one of these three triangles is similar to the original triangle, find its angles. (A Shapovalov)

Compute the number of ways to select $99$ cells in a $19 \times 19$ square grid such that no two selected cells share an edge or a vertex.

Let n be the sum of the digits in a natural number A. The number A it's said to be "surtido" if every number 1,2,3,4....,n can be expressed as a sum of digits in A. a)Prove that, if 1,2,3,4,5,6,7,8 are sums of digits in A, then A is "Surtido" b)If 1,2,3,4,5,6,7 are sums of digits in A, does it follow that A is "Surtido"?

The perimeter, that is, the sum of the lengths of all sides of a convex quadrilateral $ ABCD $, is equal to $2004$ meters; while the length of its diagonal $ AC $ is equal to $1001$ meters. Find out if the length of the other diagonal $ BD $ can: a) To be equal to only one meter. b) Be equal to the length of the diagonal $ AC $.

On a line, $44$ points are marked and numbered $1, 2, 3,…,44$ from left to right. Various crickets jump around the line. Each starts at point $1$, jumping on the marked points and ending up at point $44$. In addition, each cricket jumps from a marked point to another marked point with a greater number. When all the crickets have finished jumping, it turns out that for pair $i, j$ with ${1}\leq{i}<{j}\leq{44}$, there was a cricket that jumped directly from point $i$ to point $j$, without visiting any of the points in between the two. Determine the smallest number of crickets such that this is possible.

A line passes through the points $\left(-1,3\right)$ and $\left(7,-2\right)$. At what value of $x$ does this line intercept the $x$-axis? $\text{(A) }\frac{7}{5}\qquad\text{(B) }\frac{19}{8}\qquad\text{(C) }\frac{19}{5}\qquad\text{(D) }\frac{27}{5}\qquad\text{(E) }\frac{23}{4}$

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Determine whether there exist an infinite number of positive integers $x,y $ satisfying the condition: $x^2+y \mid x+y^2.$ Please prove it.

Real numbers $a$ and $b$ satisfy the system of equations $$\begin{cases} a^3-a^2+a-5=0 \\ b^3-2b^2+2b+4=0 \end{cases}$$ Find the numerical value of the sum $a+ b$.

Let $\Gamma$ a circumference. $T$ a point in $\Gamma$, $P$ and $A$ two points outside $\Gamma$ such that $PT$ is tangent to $\Gamma$ and $PA=PT$. Let $C$ a point in $\Gamma (C\neq T)$, $AC$ and $PC$ intersect again $\Gamma$ in $D$ and $B$, respectively. $AB$ intersect $\Gamma$ in $E$. Prove that $DE$ it´s parallel to $AP$

Bilbo, Gandalf, and Nitzan play the following game. First, Nitzan picks a whole number between $1$ and $2^{2022}$ inclusive and reveals it to Bilbo. Bilbo now compiles a string of length $4044$ built from the three letters $a,b,c$. Nitzan looks at the string, chooses one of the three letters $a,b,c$, and removes from the string all instances of the chosen letter. Only then is the string revealed to Gandalf. He must now guess the number Nitzan chose. Can Bilbo and Gandalf work together and come up with a strategy beforehand that will always allow Gandalf to guess Nitzan's number correctly, no matter how he acts?

Find all polynomials $f(x)$ with real coefficients having the property $f(g(x))=g(f(x))$ for every polynomial $g(x)$ with real coefficients.

Let $P(x)$ be a monic polynomial of degree $n$ with nonnegative coefficients and the free term equal to $1$. Prove that if all the roots of $P(x)$ are real, then $P(x) \geq (x+1)^{n}$ holds for every $x \geq 0$.

Baron Munchhausen has a collection of stones, such that they are of $1000$ distinct whole weights, $2^{1000}$ stones of every weight. Baron states that if one takes exactly one stone of every weight, then the weight of all these $1000$ stones chosen will be less than $2^{1010}$, and there is no other way to obtain this weight by picking another set of stones of the collection. Can this statement happen to be true? [i](М. Антипов)[/i] [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

For a fixed positive integer $n \geq 3$ we are given a $n$ $\times$ $n$ board with all unit squares initially white. We define a [i]floating plus [/i]as a $5$-tuple $(M,L,R,A,B)$ of unit squares such that $L$ is in the same row and left of $M$, $R$ is in the same row and right of $M$, $A$ is in the same column and above $M$ and $B$ is in the same column and below $M$. It is possible for $M$ to form a floating plus with unit squares that are not next to it. Find the largest positive integer $k$ (depending on $n$) such that we can color some $k$ squares black in such a way that there is no black colored floating plus. [i]Authored by Nikola Velov[/i]

Compute the sum of the series $\sum_{k=0}^{\infty} \frac{1}{(4k+1)(4k+2)(4k+3)(4k+4)} = \frac{1}{1\cdot2\cdot3\cdot4} + \frac{1}{5\cdot6\cdot7\cdot8} + ...$

For a positive integer $n$, let \[S_n=\int_0^1 \frac{1-(-x)^n}{1+x}dx,\ \ T_n=\sum_{k=1}^n \frac{(-1)^{k-1}}{k(k+1)}\] Answer the following questions: (1) Show the following inequality. \[\left|S_n-\int_0^1 \frac{1}{1+x}dx\right|\leq \frac{1}{n+1}\] (2) Express $T_n-2S_n$ in terms of $n$. (3) Find the limit $\lim_{n\to\infty} T_n.$

Jackson has a $5\times 5$ grid of squares. He places coins in the grid squares $-$ at most one per square $-$ so that no row, column, or diagonal has five coins. What is the maximum number of coins that he can place?

A finite arithmetic progression of positive integers $a_1,a_2,\ldots,a_n$ satisfies the condition that for all $1\leq i<j\leq n$, the number of positive divisors of $\gcd\left(a_i,a_j\right)$ is equal to $j-i$. Find the maximum possible value of $n$. $\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }6$

An acute, non-isosceles triangle $ABC$ is inscribed in a circle with centre $O$. A line go through $O$ and midpoint $I$ of $BC$ intersects $AB, AC$ at $E, F$ respectively. Let $D, G$ be reflections to $A$ over $O$ and circumcentre of $(AEF)$, respectively. Let $K$ be the reflection of $O$ over circumcentre of $(OBC)$. $a)$ Prove that $D, G, K$ are collinear. $b)$ Let $M, N$ are points on $KB, KC$ that $IM\perp AC$, $IN\perp AB$. The midperpendiculars of $IK$ intersects $MN$ at $H$. Assume that $IH$ intersects $AB, AC$ at $P, Q$ respectively. Prove that the circumcircle of $\triangle APQ$ intersects $(O)$ the second time at a point on $AI$.

The average value of all the pennies, nickels, dimes, and quarters in Paula's purse is $ 20$ cents. If she had one more quarter, the average value would be $ 21$ cents. How many dimes does she have in her purse? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3\qquad \textbf{(E)}\ 4$

$\omega$ is circumcirlce of triangle $ABC$. We draw a line parallel to $BC$ that intersects $AB,AC$ at $E,F$ and intersects $\omega$ at $U,V$. Assume that $M$ is midpoint of $BC$. Let $\omega'$ be circumcircle of $UMV$. We know that $R(ABC)=R(UMV)$. $ME$ and $\omega'$ intersect at $T$, and $FT$ intersects $\omega'$ at $S$. Prove that $EF$ is tangent to circumcircle of $MCS$.

Let $x=\cos 36^{\circ} - \cos 72^{\circ}$. Then $x$ equals $ \textbf{(A)}\ \frac{1}{3} \qquad\textbf{(B)}\ \frac{1}{2} \qquad\textbf{(C)}\ 3-\sqrt{6} \qquad\textbf{(D)}\ 2\sqrt{3}-3 \qquad\textbf{(E)}\ \text{none of these} $