Find all positive integers $k$ such that the product of the first $k$ primes increased by $1$ is a power of an integer (with an exponent greater than $1$).

Consider the polynomial f(x) = cx(x - 2) where $c$ is a positive real number. For any $n \in Z^+$, the notation $g_n(x)$ is a composite function $n$ times of $f$ and assume that the equation $g_n(x) = 0$ has all of the $2^n$ solutions are real numbers. 1. For $c = 5$, find in terms of $n$, the sum of all the solutions of $g_n(x)$, of which each multiple (if any) is counted only once. 2. Prove that $c\ge 1$.

Given is triangle $ABC$ with $AB > AC$. Circles $O_B$, $O_C$ are inscribed in angle $BAC$ with $O_B$ tangent to $AB$ at $B$ and $O_C$ tangent to $AC$ at $C$. Tangent to $O_B$ from $C$ different than $AC$ intersects $AB$ at $K$ and tangent to $O_C$ from $B$ different than $AB$ intersects $AC$ at $L$. Line $KL$ and the angle bisector of $BAC$ intersect $BC$ at points $P$ and $M$, respectively. Prove that $BP = CM$.

At a gala banquet, $12n + 6$ chairs, where $n \in N$, are equally arranged around a large round table. A seating will be called a proper seating of rank $n$ if a gathering of $6n + 3$ married couples sit around this table such that each seated person also has exactly one sibling (brother/sister) of the opposite gender present (siblings cannot be married to each other) and each man is seated closer to his wife than his sister. Among all proper seats of rank n find the maximum possible number of women seated closer to their brother than their husband. (The maximum is taken not only across all possible seating arrangements for a given gathering, but also across all possible gatherings.)

Define $a_0 = 2$ and $a_{n+1} = a^2_n + a_n -1$ for $n \ge 0$. Prove that $a_n$ is coprime to $2n + 1$ for all $n \in N$.

Given is an acute triangle $ABC$ with $BC < CA < AB$. Points $K$ and $L$ lie on segments $AC$ and $AB$ and satisfy $AK = AL = BC$. Perpendicular bisectors of segments $CK$ and $BL$ intersect line $BC$ at points $P$ and $Q$, respectively. Segments $KP$ and $LQ$ intersect at $M$. Prove that $CK + KM = BL + LM$.

A rectangle $R$ is partitioned into smaller rectangles whose sides are parallel with the sides of $R$. Let $B$ be the set of all boundary points of all the rectangles in the partition, including the boundary of $R$. Let S be the set of all (closed) segments whose points belong to $B$. Let a maximal segment be a segment in $S$ which is not a proper subset of any other segment in $S$. Let an intersection point be a point in which $4$ rectangles of the partition meet. Let $m$ be the number of maximal segments, $i$ the number of intersection points and $r$ the number of rectangles. Prove that $m + i = r + 3$.

Find all functions $f : R \to R$ such that $$2f(x)f(x + y) -f(x^2) =\frac{x}{2}(f(2x) + 4f(f(y)))$$for all $x, y \in R$.

For each non-constant integer polynomial $P(x)$, let’s define $$M_{P(x)} = \underset{x\in [0,2021]}{\max} |P(x)|.$$ 1. Find the minimum value of $M_{P(x)}$ when deg $P(x) = 1$. 2. Suppose that $P(x) \in Z[x]$ when deg $P(x) = n$ and $2 \le n \le 2022$. Prove that $M_{P(x)} \ge 1011$.

Point $M$ on side $AB$ of quadrilateral $ABCD$ is such that quadrilaterals $AMCD$ and $BMDC$ are circumscribed around circles centered at $O_1$ and $O_2$ respectively. Line $O_1O_2$ cuts an isosceles triangle with vertex $M$ from angle $CMD$. prove that $ABCD$ is a cyclc quadrilateral.

Let $p$ be a prime number and let $m, n$ be integers greater than $1$ such that $n | m^{p(n-1)} - 1$. Prove that $gcd(m^{n-1} - 1, n) > 1$.

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

Let $ABC$ be an acute-angled triangle. Point $P$ is such that $AP = AB$ and $PB \parallel AC$. Point $Q$ is such that $AQ = AC$ and $CQ \parallel AB$. Segments $CP$ and $BQ$ meet at point $X$. Prove that the circumcenter of triangle $ABC$ lies on the circumcircle of triangle $PXQ$.

Find all positive integers $n$ that have precisely $\sqrt{n + 1}$ natural divisors.

Let $n$ be an even positive integer. On a board n real numbers are written. In a single move we can erase any two numbers from the board and replace each of them with their product. Prove that for every $n$ initial numbers one can in finite number of moves obtain $n$ equal numbers on the board.

Consider the function $f : R^+ \to R^+$ and satisfying $$f(x + 2y + f(x + y)) = f(2x) + f(3y), \,\, \forall \,\, x, y > 0.$$ 1. Find all functions $f(x)$ that satisfy the given condition. 2. Suppose that $f(4\sin^4x)f(4\cos^4x) \ge f^2(1)$ for all $x \in \left(0\frac{\pi}{2}\right) $. Find the minimum value of $f(2022)$.

By $rad(x)$ we denote the product of all distinct prime factors of a positive integer $n$. Given $a \in N$, a sequence $(a_n)$ is defined by $a_0 = a$ and $a_{n+1} = a_n+rad(a_n)$ for all $n \ge 0$. Prove that there exists an index $n$ for which $\frac{a_n}{rad(a_n)} = 2022$

Determine if there exist functions $f, g : R \to R$ satisfying for every $x \in R$ the following equations $f(g(x)) = x^3$ and $g(f(x)) = x^2$.

We consider all partitions of a positive integer n into a sum of (nonnegative integer) exponents of $2$ (i.e. $1$, $2$, $4$, $8$ , $ . . .$ ). A number in the sum is allowed to repeat an arbitrary number of times (e.g. $7 = 2 + 2 + 1 + 1 + 1$) and two partitions differing only in the order of summands are considered to be equal (e.g. $8 = 4 + 2 + 1 + 1$ and $8 = 1 + 2 + 1 + 4$ are regarded to be the same partition). Let $E(n)$ be the number of partitions in which an even number of exponents appear an odd number of times and $O(n)$ the number of partitions in which an odd number of exponents appear an odd number of times. For example, for $n = 5$ partitions counted in $E(n)$ are $5 = 4 + 1$ and $5 = 2 + 1 + 1 + 1$, whereas partitions counted in O(n) are $5 = 2 + 2 + 1$ and $5 = 1 + 1 + 1 + 1 + 1$, hence $E(5) = O(5) = 2$. Find $E(n) - O(n)$ as a function of $n$.