Solve equation $(x^4 + 3y^2)\sqrt{|x + 2| + |y|}=4|xy^2|$ in real numbers $x$, $y$.

There are $10$ points on a circle and all possible segments are drawn on the which two of these points are the endpoints. Determine the probability that selecting two segments randomly, they intersect at some point (it could be on the circumference).

There are $100$ glasses, with $101,102,...,200$ cents.Two players play next game. In every move they can take some cents from one glass, but after move should be different number of cents in every glass. Who will win with right strategy?

Tristan is eating his favorite cereal, Tiger Crunch, which has marshmallows of two colors, black and orange. He eats the marshmallows by randomly choosing from those remaining one at a time, and he starts out with $17$ orange and $5$ black marshmallows. If $\frac{p}{q}$ is the expected number of marshmallows remaining the instant that there is only one color left, and $p$ and $q$ are relatively prime positive integers, find $p + q$.

Axel and Berta play the following games: On a board are a number of positive integers. One move consists of a player exchanging a number $x$ on the board for two positive integers y and $z$ (not necessarily different), such that $y + z = x$. The game ends when the numbers on the board are relatively coprime in pairs. The player who made the last move has then lost the game. At the beginning of the game, only the number $2015$ is on the board. The two players make do their moves in turn and Berta begins. One of the players has a winning strategy. Who, and why?

Find all real solutions to: \begin{eqnarray*} 3(x^2 + y^2 + z^2) &=& 1 \\ x^2y^2 + y^2z^2 + z^2x^2 &=& xyz(x + y + z)^3. \end{eqnarray*}

Let $BB_1$ be the symmedian of a nonisosceles acute-angled triangle $ABC$. Ray $BB_1$ meets the circumcircle of $ABC$ for the second time at point $L$. Let $AH_A, BH_B, CH_C$ be the altitudes of triangle $ABC$. Ray $BH_B$ meets the circumcircle of $ABC$ for the second time at point $T$. Prove that $H_A, H_C, T, L$ are concyclic.

Find all triples $(a, b, c)$ of natural numbers $a, b$ and $c$, for which $a^{b + 20} (c-1) = c^{b + 21} - 1$ is satisfied. (Walther Janous)

For a positive integer $n$, let $f(n)$ be the number of (not necessarily distinct) primes in the prime factorization of $k$. For example, $f(1) = 0, f(2) = 1, $ and $f(4) = f(6) = 2$. let $g(n)$ be the number of positive integers $k \leq n$ such that $f(k) \geq f(j)$ for all $j \leq n$. Find $g(1) + g(2) + \ldots + g(100)$.

A point $T$ is chosen inside a triangle $ABC$. Let $A_1$, $B_1$, and $C_1$ be the reflections of $T$ in $BC$, $CA$, and $AB$, respectively. Let $\Omega$ be the circumcircle of the triangle $A_1B_1C_1$. The lines $A_1T$, $B_1T$, and $C_1T$ meet $\Omega$ again at $A_2$, $B_2$, and $C_2$, respectively. Prove that the lines $AA_2$, $BB_2$, and $CC_2$ are concurrent on $\Omega$. [i]Proposed by Mongolia[/i]

Let $ABCDE$ be a convex pentagon such that $\angle ABC = \angle AED = 90^\circ$. Suppose that the midpoint of $CD$ is the circumcenter of triangle $ABE$. Let $O$ be the circumcenter of triangle $ACD$. Prove that line $AO$ passes through the midpoint of segment $BE$.

In the lower left corner of the square $7 \times 7$ board there is a king. In one move, he can move either one cell to the right, or one cell up, or one cell diagonally - to the right and up. How many different ways can the king get to the upper right corner of the board if he is prohibited from visiting the central square?

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer that is the product of three distinct prime numbers!" Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool! My favorite number is not among those four numbers, though." Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu and Andrew Milas[/i]

We call natural numbers [i]similar[/i] if they are written with the same (decimal) digits. For example, 112, 121, 211 are similar numbers having the digits 1, 1, 2. Show that there exist three similar 1995-digit numbers with no zero digits, such that the sum of two of them equals the third. [i]S. Dvoryaninov[/i]

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

The diagram shows two congruent isosceles triangles in a $20\times20$ square which has been partitioned into four $10\times10$ squares. Find the area of the shaded region. [asy] import graph; size(4.4cm); real labelscalefactor = 0.5; pen dotstyle = black; fill((-2,5)--(0,1)--(1,3)--(1,5)--cycle,gray); draw((-3,5)--(1,5), linewidth(2.2)); draw((1,5)--(1,1), linewidth(2.2)); draw((1,1)--(-3,1), linewidth(2.2)); draw((-3,1)--(-3,5), linewidth(2.2)); draw((-1,5)--(-1,1), linewidth(2.2)); draw((-3,3)--(1,3), linewidth(2.2)); draw((-2,5)--(-3,3), linewidth(1.4)); draw((-2,5)--(0,1), linewidth(1.4)); draw((0,1)--(1,3), linewidth(1.4)); draw((-2,5)--(0,1)); draw((0,1)--(1,3)); draw((1,3)--(1,5)); draw((1,5)--(-2,5));[/asy]

Urn A contains $4$ white balls and $2$ red balls. Urn B contains $3$ red balls and $3$ black balls. An urn is randomly selected, and then a ball inside of that urn is removed. We then repeat the process of selecting an urn and drawing out a ball, without returning the first ball. What is the probability that the first ball drawn was red, given that the second ball drawn was black?

Let $n \ge 3$ be an integer. Find the minimal value of the real number $k_n$ such that for all positive numbers $x_1, x_2, ..., x_n$ with product $1$, we have $$\frac{1}{\sqrt{1 + k_nx_1}}+\frac{1}{\sqrt{1 + k_nx_2}}+ ... + \frac{1}{\sqrt{1 + k_nx_n}} \le n - 1.$$

Let $ABC$ be an acute scalene triangle. Let $X$ and $Y$ be two distinct interior points of the segment $BC$ such that $\angle{CAX} = \angle{YAB}$. Suppose that: $1)$ $K$ and $S$ are the feet of the perpendiculars from from $B$ to the lines $AX$ and $AY$ respectively. $2)$ $T$ and $L$ are the feet of the perpendiculars from $C$ to the lines $AX$ and $AY$ respectively. Prove that $KL$ and $ST$ intersect on the line $BC$.

Determine all positive integers $n > 2$ , such that \[ \frac{1}{2} \varphi(n) \equiv 1 ( \bmod 6) \]

. In the isosceles triangle $ABC$ with $AC = BC$ we denote by $D$ the foot of the altitude through $C$. The midpoint of $CD$ is denoted by $M$. The line $BM$ intersects $AC$ in $E$. Prove that the length of $AC$ is three times that of $CE$.

In the expression $(x + 100) (x + 99) ... (x-99) (x-100)$, the brackets were expanded and similar terms were given. The expression $x^{201} + ...+ ax^2 + bx + c$ turned out. Find the numbers $a$ and $c$.

The figure shows an arbitrary (green) triangle in the center. White squares were built on its sides to the outside. Some of their vertices were connected by segments, white squares were built on them again to the outside, and so on. In the spaces between the squares, triangles and quadrilaterals were formed, which were painted in different colors. Prove that [list=a] [*]all colored quadrilaterals are trapezoids; [*]the areas of all polygons of the same color are equal; [*]the ratios of the bases of one-color trapezoids are equal; [*]if $S_0=1$ is the area of the original triangle, and $S_i$ is the area of the colored polygons at the $i^{\text{th}}$ step, then $S_1=1$, $S_2=5$ and for $n\geqslant 3$ the equality $S_n=5S_{n-1}-S_{n-2}$ is satisfied. [/list] [i]Proposed by F. Nilov[/i] [center][img width="40"]https://i.ibb.co/n8gt0pV/Screenshot-2023-03-09-174624.png[/img][/center]

Among $100$ points in the plane, no three collinear, exactly $4026$ pairs are connected by line segments. Each point is then randomly assigned an integer from $1$ to $100$ inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least $50$. [i]Proposed by Evan Chen[/i]

Let $p$ be a prime number such that $3p+10$ is a sum of squares of six consecutive positive integers. Prove that $p-7$ is divisible by $36$.