Find all integers $a,b,m,n$, with $m>n>1$, for which the polynomial $f(X)=X^n+aX+b$ divides the polynomial $g(X)=X^m+aX+b$. [i]Laurentiu Panaitopol[/i]

Let $n\geq2$ be a positive integer. Determine all possible values of the sum \[ S=\left\lfloor x_{2}-x_{1}\right\rfloor +\left\lfloor x_{3}-x_{2}\right\rfloor+...+\left\lfloor x_{n}-x_{n-1}\right\rfloor \] where $x_i\in \mathbb{R}$ satisfying $\lfloor{x_i}\rfloor=i$ for $i=1,2,\ldots n$.

For what values of the variable $x$ does the following inequality hold: \[ \dfrac{4x^2}{(1-\sqrt{2x+1})^2}<2x+9 \ ? \]

Does there exist a function $f(n)$, which maps the set of natural numbers into itself and such that for each natural number $n > 1$ the following equation is satisfied $$f(n) = f(f(n - 1)) + f(f(n + 1))?$$

Let $a, b$ and $c$ be positive real numbers such that min $\{ab, bc, ca\} \ge 1$. Prove that $$\sqrt[3]{(a^2 + 1)(b^2 + 1)(c^2 + 1)} \le (\frac{a+b+c}{3} )^2 + 1 $$

Powers of $2$ in base $10$ start with $3$ or $4$ more frequently? What is their state in base $3$? First write down an exact form of the question.

Suppose that $ f(x)\in\mathbb Z[x]$ be an irreducible polynomial. It is known that $ f$ has a root of norm larger than $ \frac32$. Prove that if $ \alpha$ is a root of $ f$ then $ f(\alpha^3\plus{}1)\neq0$.

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$

Let $a, b,c$ be positive real numbers satisfying the condition $$(x + y + z) \left( \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\right)= 10$$ Find the greatest value and the least value of $$T = (x^2 + y^2 + z^2) \left(\frac{1}{x^2} + \frac{1}{y^2} + \frac{1}{z^2}\right)$$ Trần Nam Dũng

The roots of the polynomial $x^3 - \frac32 x^2 - \frac14 x + \frac38 = 0$ are in arithmetic progression. What are they?

$P(x)$ is a polynomial in $x$ with non-negative integer coefficients. If $P(1)=5$ and $P(P(1))=177$, what is the sum of all possible values of $P(10)$?

Prove that for all positive real numbers $x, y$ and $z$, the double inequality $$0 < \frac{1}{x + y + z + 1} -\frac{1}{(x + 1)(y + 1)(z + 1)} \le \frac18$$ holds. When does equality hold in the right inequality? [i](Walther Janous)[/i]

There are positive integers $m$ and $n$ such that $m^2 -n = 32$ and $\sqrt[5]{m +\sqrt{n}}+ \sqrt[5]{m -\sqrt{n}}$ is a real root of the polynomial $x^5 - 10x^3 + 20x - 40$. Find $m + n$.

Solve the equation $$arc \sin (\sin x) + arc \cos (\cos x)=0$$

[b]p1.[/b] There are $16$ students in a class. Each month the teacher divides the class into two groups. What is the minimum number of months that must pass for any two students to be in different groups in at least one of the months? [b]p2.[/b] Find all functions $f(x)$ defined for all real $x$ that satisfy the equation $2f(x) + f(1 - x) = x^2$. [b]p3.[/b] Arrange the digits from $1$ to $9$ in a row (each digit only once) so that every two consecutive digits form a two-digit number that is divisible by $7$ or $13$. [b]p4.[/b] Prove that $\cos 1^o$ is irrational. [b]p5.[/b] Consider $2n$ distinct positive Integers $a_1,a_2,...,a_{2n}$ not exceeding $n^2$ ($n>2$). Prove that some three of the differences $a_i- a_j$ are equal . PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A large candle is $119$ centimeters tall. It is designed to burn down more quickly when it is first lit and more slowly as it approaches its bottom. Specifically, the candle takes $10$ seconds to burn down the first centimeter from the top, $20$ seconds to burn down the second centimeter, and $10k$ seconds to burn down the $k$-th centimeter. Suppose it takes $T$ seconds for the candle to burn down completely. Then $\tfrac{T}{2}$ seconds after it is lit, the candle's height in centimeters will be $h$. Find $10h$.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

Find the total number of solutions to the following system of equations: $ \{\begin{array}{l} a^2 + bc\equiv a \pmod{37} \\ b(a + d)\equiv b \pmod{37} \\ c(a + d)\equiv c \pmod{37} \\ bc + d^2\equiv d \pmod{37} \\ ad - bc\equiv 1 \pmod{37} \end{array}$

If positive reals $ x_1,x_2,\cdots,x_n $ satisfy $\sum_{i=1}^{n}x_i=1.$ Prove that$$\sum_{i=1}^{n}\frac{1}{1+\sum_{j=1}^{i}x_j}<\sqrt{\frac{2}{3}\sum_{i=1}^{n}\frac{1}{x_i}} $$

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

There are $n$ positive real numbers on the board $a_1,\ldots, a_n$. Someone wants to write $n$ real numbers $b_1,\ldots,b_n$,such that: $b_i\geq a_i$ If $b_i \geq b_j$ then $\frac{b_i}{b_j}$ is integer. Prove that it is possible to write such numbers with the condition $$b_1 \cdots b_n \leq 2^{\frac{n-1}{2}}a_1\cdots a_n.$$

Let $Q^+$ denote the set of all positive rational number and let $\alpha\in Q^+.$ Determine all functions $f:Q^+ \to (\alpha,+\infty )$ satisfying $$f(\frac{ x+y}{\alpha}) =\frac{ f(x)+f(y)}{\alpha}$$ for all $x,y\in Q^+ .$

Find all functions $f : R \to R$ satisfying the condition $f(x- f(y)) = 1+x-y$ for all $x,y \in R$.

A polynomial $P(x)$ of degree $n \ge 5$ with integer coefficients has $n$ distinct integer roots, one of which is $0$. Find all integer roots of the polynomial $P(P(x))$.

Find the sum of the coefficients of the polynomial $(63x-61)^4$.