Find the number of real numbers $x$ that satisfy the equation $(3^x)^{x+2} + (4^x)^{x+2} - (6^x)^{x+2} = 1$

Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that (1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$; (2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees; (3) for any integers $ x, |f(x)|$ isn't prime numbers.

Find all possible values of $$\frac{(a+b-c)^2}{(a-c)(b-c)}+\frac{(b+c-a)^2}{(b-a)(c-a)}+\frac{(c+a-b)^2}{(c-b)(a-b)}$$

Find all function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ such that $f(f(x)+f(y))+f(x)f(y)=f(x+y)f(x-y)$ for all integer $x,y$

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Find $a$ if $a$ and $b$ are integers such that $x^2 - x - 1$ is a factor of $ax^{17} + bx^{16} + 1$.

Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that \[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\] and \[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\] [i]Calvin Deng.[/i]

(a) Show that, if $I \subset R$ is a closed bounded interval, and $f : I \to R$ is a non-constant monic polynomial function such that $max_{x\in I}|f(x)|< 2$, then there exists a non-constant monic polynomial function $g : I \to R$ such that $max_{x\in I} |g(x)| < 1$. (b) Show that there exists a closed bounded interval $I \subset R$ such that $max_{x\in I}|f(x)| \ge 2$ for every non-constant monic polynomial function $f : I \to R$.

If $ f(x) \equal{} ax \plus{} b$ and $ f^{ \minus{} 1}(x) \equal{} bx \plus{} a$ with $ a$ and $ b$ real, what is the value of $ a \plus{} b$? $ \textbf{(A)} \minus{} \!2 \qquad \textbf{(B)} \minus{} \!1 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$

Positive rational number $a$ and $b$ satisfy the equality \[a^3 + 4a^2b = 4a^2 + b^4.\] Prove that the number $\sqrt{a}-1$ is a square of a rational number.

Let $p$ a positive prime number and $\mathbb{F}_{p}$ the set of integers $mod \ p$. For $x\in \mathbb{F}_{p}$, define $|x|$ as the cyclic distance of $x$ to $0$, that is, if we represent $x$ as an integer between $0$ and $p-1$, $|x|=x$ if $x<\frac{p}{2}$, and $|x|=p-x$ if $x>\frac{p}{2}$ . Let $f: \mathbb{F}_{p} \rightarrow \mathbb{F}_{p}$ a function such that for every $x,y \in \mathbb{F}_{p}$ \[ |f(x+y)-f(x)-f(y)|<100 \] Prove that exist $m \in \mathbb{F}_{p}$ such that for every $x \in \mathbb{F}_{p}$ \[ |f(x)-mx|<1000 \]

Let $P$ be a polynomial satisfying $P(x + 1) + P(x - 1) = x^3$ for all real numbers $x$. Find the value of $P(12)$.

Find the largest value of $a^b$ such that the positive integers $a,b>1$ satisfy $$a^bb^a+a^b+b^a=5329$$

Show that a set $A$ consisting of $16$ consecutive non-negative integers can be partitioned in two disjoint sets $X$ and $Y$ each containing $8$ elements so that \(\sum\limits_{x\in X}x^k=\sum\limits_{y\in Y} y^k,\) for $k=1,2,3.$

Let $a=1+10^{-4}$. Consider some $2023\times 2023$ matrix with each entry a real in $[1,a]$. Let $x_i$ be the sum of the elements of the $i$-th row and $y_i$ be the sum of the elements of the $i$-th column for each integer $i\in [1,n]$. Find the maximum possible value of $\dfrac{y_1y_2\cdots y_{2023}}{x_1x_2\cdots x_{2023}}$ (the answer may be expressed in terms of $a$).

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

$p(x) $ is a real polynomial of degree $3$. Find necessary and sufficient conditions on its coefficients in order that $p(n)$ is integral for every integer $n$.

Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.

Find all continuous functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that satisfy: $ \text{(i)}\text{id}+f $ is nondecreasing $ \text{(ii)} $ There is a natural number $ m $ such that $ \text{id}+f+f^2\cdots +f^m $ is nonincreasing. Here, $ \text{id} $ represents the identity function, and ^ denotes functional power.

Find the equation of cylinder that passes three straight lines $L_1= \begin{cases} x=0\\ y-z=2 \end{cases}, L_2= \begin{cases} x=0\\ x+y-z+2=0 \end{cases}, L_3= \begin{cases} x=\sqrt{2}\\ y-z=0 \end{cases}$.

Let $(a_n)_{n=1}^{\infty}$ be a strictly increasing sequence such that inequality $$a_n(a_n-2a_{n-1})+a_{n-1}(a_{n-1}-2a_{n-2})\geq 0$$ holds for all $n \geq 3$. Prove that for all $n\geq2$ the inequality $$a_n \geq a_{n-1}+a_{n-2}+\dots+a_1$$ holds as well.

Let $a_1, a_2, a_3, a_4, a_5$ be non-negative real numbers satisfied \[\sum_{k = 1}^{5} a_k = 20 \ \ \ \ \text{and} \ \ \ \ \sum_{k=1}^{5} a_k^2 = 100\] Find the minimum and maximum of $\text{max} \{a_1, a_2, a_3, a_4, a_5\}$

Let $a$ and $b$ be positive real numbers smaller than $1$. Prove that the following two statements are equivalent: (i) $a+b = 1$, (ii) Whenever $x,y$ are positive real numbers such that $x < 1, y < 1, ax+by < 1$, the following inequlity holds: $$\frac{1}{1-ax-by} \le \frac{a}{1-x} + \frac{b}{1-y}$$

Let $a, b, c$ be integers and let $p$ be an odd prime with \[p \not\vert a \;\; \text{and}\;\; p \not\vert b^{2}-4ac.\] Show that \[\sum_{k=1}^{p}\left( \frac{ak^{2}+bk+c}{p}\right) =-\left( \frac{a}{p}\right).\]

Let $\Omega=\{z=x+iy~\in\mathbb{C}~:~|y|\leqslant 1\}$. If $f(z)=z^2+2$, then draw a sketch of $$f\Big(\Omega\Big)=\{f(z):z\in\Omega\}$$ Justify your answer.