Number of solutions of the equation $3^x+4^x=8^x$ in reals is [list=1] [*] 0 [*] 1 [*] 2 [*] $\infty$ [/list]

If numbers $x_1$, $x_2$,...,$x_n$ are from interval $\left( \frac{1}{4},1 \right)$ prove the inequality: $\log _{x_1} {\left(x_2-\frac{1}{4} \right)} + \log _{x_2} {\left(x_3-\frac{1}{4} \right)}+ ... + \log _{x_{n-1}} {\left(x_n-\frac{1}{4} \right)} + \log _{x_n} {\left(x_1-\frac{1}{4} \right)} \geq 2n$

Prove that there does not exist a polynomial $P (x)$ with integer coefficients and a natural number $m$ such that $$x^m + x + 2 = P(P(x))$$ holds for all integers $x$.

Solve the system of equations in integers: \[\begin{cases}z^x=y^{2x}\\ 2^z=4^x\\ x+y+z=20.\end{cases}\]

Let $p$ be an odd prime number. Let $S$ be the sum of all primitive roots modulo $p$. Show that if $p-1$ isn't squarefree (i. e., if there exist integers $k$ and $m$ with $k>1$ and $p-1=k^2m$), then $S \equiv 0 \mod p$. If not, then what is $S$ congruent to $\mod p$ ?

Let $a,b,c,d\in\mathbb{Z}_{\ge 0}$, $d\ne 0$ and the function $f:\mathbb{Z}_{\ge 0}\to\mathbb Z_{\ge 0}$ defined by \[f(n)=\left\lfloor \frac{an+b}{cn+d}\right\rfloor\text{ for all } n\in\mathbb{Z}_{\ge 0}.\] Prove that the following are equivalent: [list=1] [*] $f$ is surjective; [*] $c=0$, $b<d$ and $0<a\le d$. [/list] [i]Tiberiu Trif[/i]

Suppose that a function $f:\mathbb R\to\mathbb R$ satisfies the following conditions: (i) $\left|f(a)-f(b)\right|\le|a-b|$ for all $a,b\in\mathbb R$; (ii) $f(f(f(0)))=0$. Prove that $f(0)=0$.

Prove that the product of the $99$ fractions $$\frac{k^3-1}{k^3+1} \,\, , \,\,\,\,\,\, k=2,3,...,100$$ is greater than $2/3$. (D. Fomin, Leningrad)

Let $f, g : \mathbb R \to \mathbb R$ be two functions such that $g\circ f : \mathbb R \to \mathbb R$ is an injective function. Prove that $f$ is also injective.

10. The sum $\sum_{k=1}^{2020} k \cos \left(\frac{4 k \pi}{4041}\right)$ can be written in the form $$ \frac{a \cos \left(\frac{p \pi}{q}\right)-b}{c \sin ^{2}\left(\frac{p \pi}{q}\right)} $$ where $a, b, c$ are relatively prime positive integers and $p, q$ are relatively prime positive integers where $p<q$. Determine $a+b+c+p+q$.

The real number $a>1$ is given. Suppose that $r$, $s$ and $t$ are different positive integer numbers such that $\{a^r\}=\{a^s\}=\{a^t\}$. Prove that $\{a^r\}=\{a^s\}=\{a^t\}=0$.

$f: \mathbb R\longrightarrow\mathbb R^{+}$ is a non-decreasing function. Prove that there is a point $a\in\mathbb R$ that \[f(a+\frac1{f(a)})<2f(a)\]

The real numbers $a$, $b$, and $c$ are such that the quadratic trinomials $ax^2 + bx + c$ and $cx^2 + bx + a$ each have two strictly positive real roots. Show that the sum of all these roots is at least $4$.

Let $\left \{ c_i \right \}_{i=0}^{\infty}$ be a sequence of non-negative real numbers with $c_{2017}>0$. A sequence of polynomials is defined as $$P_{-1}(x)=0 \ , \ P_0(x)=1 \ , \ P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x).$$ Prove that there doesn't exist any integer $n>2017$ and some real number $c$ such that $$P_{2n}(x)=P_n(x^2+c).$$ [i]Proposed by Navid Safaei[/i]

Determine all $4$-tuples $(a,b, c, d)$ of positive real numbers satisfying $a + b +c + d = 1$ and $\max (\frac{a^2}{b},\frac{b^2}{a}) \cdot \max (\frac{c^2}{d},\frac{d^2}{c}) = (\min (a + b, c + d))^4$

Does there exist points $A,B$ on the curve $y=x^3$ and on $y=x^3+|x|+1$ respectively such that distance between $A,B$ is less than $\frac{1}{100}$ ?

Let $f(x)=a_0x^3+a_1x^2+a_2x+a_3$ be a polynomial with real coefficients ($a_0\ne0$) such that $|f(x)|\le1$ for every $x\in[-1,1]$. Prove that (a) there exist a constant $c$ (one and the same for all polynomials with the given property), for which (b) $|a_0|\le4$. [i]V. Petkov[/i]

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

Patty is standing on a line of planks playing a game. Define a block to be a sequence of adjacent planks, such that both ends are not adjacent to any planks. Every minute, a plank chosen uniformly at random from the block that Patty is standing on disappears, and if Patty is standing on the plank, the game is over. Otherwise, Patty moves to a plank chosen uniformly at random within the block she is in; note that she could end up at the same plank from which she started. If the line of planks begins with $n$ planks, then for sufficiently large n, the expected number of minutes Patty lasts until the game ends (where the first plank disappears a minute after the game starts) can be written as $P(1/n)f(n) + Q(1/n)$, where $P,Q$ are polynomials and $f(n) =\sum^n_{i=1}\frac{1}{i}$ . Find $P(2023) + Q(2023)$.

Characterize all triangles $ABC$ s.t. \[ AI_a : BI_b : CI_c = BC: CA : AB \] where $I_a$ etc. are the corresponding excentres to the vertices $A, B , C$

Find all real number $x$ which could be represented as $x = \frac{a_0}{a_1a_2 . . . a_n} + \frac{a_1}{a_2a_3 . . . a_n} + \frac{a_2}{a_3a_4 . . . a_n} + . . . + \frac{a_{n-2}}{a_{n-1}a_n} + \frac{a_{n-1}}{a_n}$ , with $n, a_1, a_2, . . . . , a_n$ are positive integers and $1 = a_0 \leq a_1 < a_2 < . . . < a_n$

Prove that: \[ \frac{1989}{2}\minus{}\frac{1988}{3}\plus{}\frac{1987}{4}\minus{}\cdots\minus{}\frac{2}{1989}\plus{}\frac{1}{1990}\equal{}\frac{1}{996}\plus{}\frac{3}{997}\plus{}\frac{5}{998}\plus{}\cdots\plus{}\frac{1989}{1990}\]

Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that $(\text{i})$ $x$ and $y$ are relatively prime; $(\text{ii})$ $x$ divides $y^2+m;$ $(\text{iii})$ $y$ divides $x^2+m.$

It is given function $f(x)=3x-2$ $a)$ Find $g(x)$ if $f(2x-g(x))=-3(1+2m)x+34$ $b)$ Solve the equation: $g(x)=4(m-1)x-4(m+1)$, $m \in \mathbb{R}$

Determine all real numbers $x\in\mathbb{R}$ for which \[ \left\lfloor \frac{x}{2} \right\rfloor + \left\lfloor \frac{x}{3} \right\rfloor=x-2022. \] The notation $\lfloor z \rfloor$, for $z\in\mathbb{R}$, denotes the largest integer which is less than or equal to $z$. For example: \[\lfloor 3.98 \rfloor =3 \quad \text{and} \quad \lfloor 0.14 \rfloor =0.\]