P(x) is polynomial such that, polynomial P(P(x)) is strictly monotone in all real number line. Prove that polynomial P(x) is also strictly monotone in all real number line.

Let $a, b, c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that $$\frac{1}{1+2ab}+\frac{1}{1+2bc}+\frac{1}{1+2ca}\ge 1$$

A circle is divided into arcs of equal size by $n$ points ($n \ge 1$). For any positive integer $x$, let $P_n(x)$ denote the number of possibilities for colouring all those points, using colours from $x$ given colours, so that any rotation of the colouring by $ i \cdot \frac{360^o}{n}$ , where i is a positive integer less than $n$, gives a colouring that differs from the original in at least one point. Prove that the function $P_n(x)$ is a polynomial with respect to $x$.

Say an integer polynomial is $\textit{primitive}$ if the greatest common divisor of its coefficients is $1$. For example, $2x^2+3x+6$ is primitive because $\gcd(2,3,6)=1$. Let $f(x)=a_2x^2+a_1x+a_0$ and $g(x) = b_2x^2+b_1x+b_0$, with $a_i,b_i\in\{1,2,3,4,5\}$ for $i=0,1,2$. If $N$ is the number of pairs of polynomials $(f(x),g(x))$ such that $h(x) = f(x)g(x)$ is primitive, find the last three digits of $N$.

Let $d \geq 1$ be an integer that is not the square of an integer. Prove that for every integer $n \geq 1,$ \[(n \sqrt d +1) \cdot | \sin(n \pi \sqrt d )| \geq 1\]

For a multiple of $ kb$ of $ b$ let $ a \% kb$ be the greatest number such that $ a \% kb \equal{} a \bmod b$ which is smaller than $ kb$ and not greater than $ a$ itself. Let $ n \in \mathbb{Z}^ \plus{} .$ Determine all integer pairs $ (a,b)$ with: \[ a\%b \plus{} a\%2b \plus{} a\%3b \plus{} \ldots \plus{} a\%nb \equal{} a \plus{} b \]

Given $a_1, a_2, ... , a_n$. Define $$b_k = \frac{a_1 + a_2 + ... + a_k}{k}$$ for $1 \le k\le n.$ Let $$C = (a_1 - b_1)^2 + (a_2 - b_2)^2 + ... + (a_n - b_n)^2, D = (a_1 - b_n)^2 + (a_2 - b_n)^2 + ... + (a_n - b_n)^2$$ Prove that $C \le D \le 2C$.

If $a,b,c>0$, what is the smallest possible value of $ \left\lfloor \dfrac {a+b}{c} \right\rfloor + \left\lfloor \dfrac {b+c}{a} \right\rfloor + \left\lfloor \dfrac {c+a}{b} \right\rfloor $? (Note that $ \lfloor x \rfloor $ denotes the greatest integer less than or equal to $x$.)

Let $K$ be a field having $q=p^n$ elements, where $p$ is a prime and $n\ge 2$ is an arbitrary integer number. For any $a\in K$, one defines the polynomial $f_a=X^q-X+a$. Show that: $a)$ $f=(X^q-X)^q-(X^q-X)$ is divisible by $f_1$; $b)$ $f_a$ has at least $p^{n-1}$ essentially different irreducible factors $K[X]$.

The graph below shows a portion of the curve defined by the quartic polynomial $ P(x) \equal{} x^4 \plus{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d$. Which of the following is the smallest? $ \textbf{(A)}\ P( \minus{} 1)$ $ \textbf{(B)}\ \text{The product of the zeros of }P$ $ \textbf{(C)}\ \text{The product of the non \minus{} real zeros of }P$ $ \textbf{(D)}\ \text{The sum of the coefficients of }P$ $ \textbf{(E)}\ \text{The sum of the real zeros of }P$ [asy] size(170); defaultpen(linewidth(0.7)+fontsize(7));size(250); real f(real x) { real y=1/4; return 0.2125(x*y)^4-0.625(x*y)^3-1.6125(x*y)^2+0.325(x*y)+5.3; } draw(graph(f,-10.5,19.4)); draw((-13,0)--(22,0)^^(0,-10.5)--(0,15)); int i; filldraw((-13,10.5)--(22,10.5)--(22,20)--(-13,20)--cycle,white, white); for(i=-3; i<6; i=i+1) { if(i!=0) { draw((4*i,0)--(4*i,-0.2)); label(string(i), (4*i,-0.2), S); }} for(i=-5; i<6; i=i+1){ if(i!=0) { draw((0,2*i)--(-0.2,2*i)); label(string(2*i), (-0.2,2*i), W); }} label("0", origin, SE);[/asy]

Positive real numbers $a_1, a_2, \ldots, a_{2024}$ are written on the blackboard. A move consists of choosing two numbers $x$ and $y$ on the blackboard, erasing them and writing the number $\frac{x^2+6xy+y^2}{x+y}$ on the blackboard. After $2023$ moves, only one number $c$ will remain on the blackboard. Prove that \[ c<2024 (a_1+a_2+\ldots+a_{2024}).\]

A student did not notice multiplication sign between two three-digit numbers and wrote it as a six-digit number. Result was 7 times more that it should be. Find these numbers. [i](2 points)[/i]

[b]p1.[/b] Find all prime factors of $8051$. [b]p2.[/b] Simplify $$[\log_{xyz}(x^z)][1 + \log_x y + \log_x z],$$ where $x = 628$, $y = 233$, $z = 340$. [b]p3.[/b] In prokaryotes, translation of mRNA messages into proteins is most often initiated at start codons on the mRNA having the sequence AUG. Assume that the mRNA is single-stranded and consists of a sequence of bases, each described by a single letter A,C,U, or G. Consider the set of all pieces of bacterial mRNA six bases in length. How many such mRNA sequences have either no A’s or no U’s? [b]p4.[/b] What is the smallest positive $n$ so that $17^n + n$ is divisible by $29$? [b]p5.[/b] The legs of the right triangle shown below have length $a = 255$ and $b = 32$. Find the area of the smaller rectangle (the one labeled $R$). [img]https://cdn.artofproblemsolving.com/attachments/c/d/566f2ce631187684622dfb43f36c7e759e2f34.png[/img] [b]p6.[/b] A $3$ dimensional cube contains ”cubes” of smaller dimensions, ie: faces ($2$-cubes),edges ($1$-cubes), and vertices ($0$-cubes). How many 3-cubes are in a $5$-cube? PS. You had better use hide for answers.

$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$. Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.

Quadratics $g(x) = ax^2 + bx + c$ and $h(x) = dx^2 + ex + f$ are such that the six roots of $g,h$, and $g - h$ are distinct real numbers (in particular, they are not double roots) forming an arithmetic progression in some order. Determine all possible values of $a/d$.

Find all functions $f: \mathbb{R}^{\ge 0} \to \mathbb{R}^{\ge 0}$ such that: $f(x^3+xf(xy))=f(xy)+x^2f(x+y) \forall x,y \in \mathbb{R}^{\ge 0}$

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$

Let $\{a_n\}$ be a sequence of positive terms such that $a_{n+1}=a_n+ \frac{n^2}{a_n}$ . Let $b_n =a_n-n$ . (1) Are there infinitely many $n$ such that $b_n \ge 0$ ? (2) Prove that there is a positive number $M$ such that $\sum^{\infty}_{n=3} \frac{b_n}{n+1}<M$.

Solve logarithmical equation $x^{\log _{3} {x-1}} + 2(x-1)^{\log _{3} {x}}=3x^2$

Let $ f_1,f_2,f_3,f_4 $ be four polynomials with real coefficients, having the property that $$ f_1 (1) =f_2 (0), \quad f_2 (1) =f_3 (0),\quad f_3 (1) =f_4 (0),\quad f_4 (1) =f_1 (0) . $$ Prove that there exists a polynomial $ f\in\mathbb{R}[X,Y] $ such that $$ f(X,0)=f_1(X),\quad f(1,Y) =f_2(Y) ,\quad f(1-X,1) =f_3(X),\quad f(0,1-Y)=f_4(Y) . $$

Consider the number $\alpha$ obtained by writing one after another the decimal representations of $1, 1987, 1987^2, \dots$ to the right the decimal point. Show that $\alpha$ is irrational.

A sequence $\{x_n \}=x_0, x_1, x_2, \cdots $ satisfies $x_0=a(1\le a \le 2019, a \in \mathbb{R})$, and $$x_{n+1}=\begin{cases}1+1009x_n &\ (x_n \le 2) \\ 2021-x_n &\ (2<x_n \le 1010) \\ 3031-2x_n &\ (1010<x\le 1011) \\ 2020-x_n &\ (1011<x_n) \end{cases}$$ for each non-negative integer $n$. If there exist some integer $k>1$ such that $x_k=a$, call such minimum $k$ a [i] fundamental period[/i] of $\{x_n \}$. Find all integers which can be a fundamental period of some seqeunce; and for such minimal odd period $k(>1)$, find all values of $x_0=a$ such that the fundamental period of $\{x_n \}$ equals $k$.

We call a polynomial $P(x)$ intresting if there are $1398$ distinct positive integers $n_1,...,n_{1398}$ such that $$P(x)=\sum_{}{x^{n_i}}+1$$ Does there exist infinitly many polynomials $P_1(x),P_2(x),...$ such that for each distinct $i,j$ the polynomial $P_i(x)P_j(x)$ is interesting.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying $$f(\max \left\{ x, y \right\} + \min \left\{ f(x), f(y) \right\}) = x+y $$ for all $x,y \in \mathbb{R}$.

If $a$ and $b$ are real numbers such that $$\begin{cases} a^3-3ab^2 = 8 \\ b^3-3a^2b = 11 \end{cases}$$ then what is $a^2+b^2$?