Find all sequences $a_{0}, a_{1},\ldots, a_{n}$ of real numbers such that $a_{n}\neq 0$, for which the following statement is true: If $f: \mathbb{R}\to\mathbb{R}$ is an $n$ times differentiable function and $x_{0}<x_{1}<\ldots <x_{n}$ are real numbers such that $f(x_{0})=f(x_{1})=\ldots =f(x_{n})=0$ then there is $h\in (x_{0}, x_{n})$ for which \[a_{0}f(h)+a_{1}f'(h)+\ldots+a_{n}f^{(n)}(h)=0.\]

Can every polynomial with integer coefficients be expressed as a sum of cubes of polynomials with integer coefficients? [hide]I found the following statement that can be linked to this problem: "It is easy to see that every polynomial in F[x] is sum of cubes if char (F)$\ne$3 and card (F)=2,4"[/hide]

Let $P_i(x) = x^2 + b_i x + c_i , i = 1,2, ..., n$ be pairwise distinct polynomials of degree $2$ with real coefficients so that for any $0 \le i < j \le n , i, j \in N$, the polynomial $Q_{i,j}(x) = P_i(x) + P_j(x)$ has only one real root. Find the greatest possible value of $n$.

Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying \[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\] Prove that $P(1983) = F_{1983} - 1.$

The polynomial P(x,y) is such that for every integer n >= 0 each of the polynomials P(x,n) and P(n,y) either is a constant zero or has a degree not greater than n. Is it possible that P(x,x) has an odd degree?

Let $f(x)=\sum_{i=0}^{n}a_ix^i$ and $g(x)=\sum_{i=0}^{n}b_ix^i$, where $a_n$,$b_n$ can be zero. Called $f(x)\ge g(x)$ if exist $r$ such that $\forall i>r,a_i=b_i,a_r>b_r$ or $f(x)=g(x)$. Prove that: if the leading coefficients of $f$ and $g$ are positive, then $f(f(x))+g(g(x))\ge f(g(x))+g(f(x))$

[b](a)[/b] Prove that for all positive integers $m,n$ we have \[\sum_{k=1}^n k(k+1)(k+2)\cdots (k+m-1)=\frac{n(n+1)(n+2) \cdots (n+m)}{m+1}\] [b](b)[/b] Let $P(x)$ be a polynomial with rational coefficients and degree $m.$ If $n$ tends to infinity, then prove that \[\frac{\sum_{k=1}^n P(k)}{n^{m+1}}\] Has a limit.

Find all polynomials $P(x)$ with integer coefficients such that $a^2+b^2-c^2$ divides $P(a)+P(b)-P(c)$, for all integers $a,b,c$.

Find all polynomials $P$ with integer coefficients such that all the roots of $P^n(x)$ are integers. (here $P^n(x)$ means $P(P(...(P(x))...))$ where $P$ is repeated $n$ times)

Whether exist set $A$ that contain 2016 real numbers (some of them may be equal) not all of which equal 0 such that next statement holds. For arbitrary 1008-element subset of $A$ there is a monic polynomial of degree 1008 such that elements of this subset are roots of the polynomial and other 1008 elements of $A$ are coefficients of this polynomial's degrees from 0 to 1007.

Alice and Bob are stuck in quarantine, so they decide to play a game. Bob will write down a polynomial $f(x)$ with the following properties: (a) for any integer $n$, $f(n)$ is an integer; (b) the degree of $f(x)$ is less than $187$. Alice knows that $f(x)$ satisfies (a) and (b), but she does not know $f(x)$. In every turn, Alice picks a number $k$ from the set $\{1,2,\ldots,187\}$, and Bob will tell Alice the value of $f(k)$. Find the smallest positive integer $N$ so that Alice always knows for sure the parity of $f(0)$ within $N$ turns. [i]Proposed by YaWNeeT[/i]

There are 6 distinct values of $x$ strictly between $0$ and $\frac{\pi}{2}$ that satisfy the equation \[ \tan(15 x) = 15 \tan(x) . \] Call these 6 values $r_1$, $r_2$, $r_3$, $r_4$, $r_5$, and $r_6$. What is the value of the sum \[ \frac{1}{\tan^2 r_1} + \frac{1}{\tan^2 r_2} + \frac{1}{\tan^2 r_3} + \frac{1}{\tan^2 r_4} + \frac{1}{\tan^2 r_5} + \frac{1}{\tan^2 r_6} \, ? \]

Determine all non-constant monic polynomials $P(x)$ with integer coefficients such that no prime $p>10^{100}$ divides any number of the form $P(2^n)$

For integers $a$ and $b$ with $0 \leq a,b < {2010}^{18}$ let $S$ be the set of all polynomials in the form of $P(x)=ax^2+bx.$ For a polynomial $P$ in $S,$ if for all integers n with $0 \leq n <{2010}^{18}$ there exists a polynomial $Q$ in $S$ satisfying $Q(P(n)) \equiv n \pmod {2010^{18}},$ then we call $P$ as a [i]good polynomial.[/i] Find the number of [i]good polynomials.[/i]

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

(1) Determine if there exists an infinite sequence $\{a_n\}$ with positive integer terms, such that $a^2_{n+1}\ge 2a_na_{n+2}$ for any positive integer $n$. (2) Determine if there exists an infinite sequence $\{a_n\}$ with positive irrational terms, such that $a^2_{n+1}\ge 2a_na_{n+2}$ for any positive integer $n$.

Let $P(x, y)$ be a non-constant homogeneous polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for every real number $t$. Prove that there exists a positive integer $k$ such that $P(x, y) = (x^2 + y^2)^k$.

Let $ P $ be a point in the interior of a triangle $ ABC $, and let $ D, E, F $ be the point of intersection of the line $ AP $ and the side $ BC $ of the triangle, of the line $ BP $ and the side $ CA $, and of the line $ CP $ and the side $ AB $, respectively. Prove that the area of the triangle $ ABC $ must be $ 6 $ if the area of each of the triangles $ PFA, PDB $ and $ PEC $ is $ 1 $.

Let $p$ be an odd prime number, and $k$ be an odd number not divisible by $p$. Consider a field $K$ be a field with $kp+1$ elements, and $A = \{x_1,x_2, \dots, x_t\}$ be the set of elements of $K^*$, whose order is not $k$ in the multiplicative group $(K^*,\cdot)$. Prove that the polynomial $P(X)=(X+x_1)(X+x_2)\dots(X+x_t)$ has at least $p$ coefficients equal to $1$.

Real function $f$ [b]generates[/b] real function $g$ if there exists a natural $k$ such that $f^k=g$ and we show this by $f \rightarrow g$. In this question we are trying to find some properties for relation $\rightarrow$, for example it's trivial that if $f \rightarrow g$ and $g \rightarrow h$ then $f \rightarrow h$.(transitivity) (a) Give an example of two real functions $f,g$ such that $f\not = g$ ,$f\rightarrow g$ and $g\rightarrow f$. (b) Prove that for each real function $f$ there exists a finite number of real functions $g$ such that $f \rightarrow g$ and $g \rightarrow f$. (c) Does there exist a real function $g$ such that no function generates it, except for $g$ itself? (d) Does there exist a real function which generates both $x^3$ and $x^5$? (e) Prove that if a function generates two polynomials of degree 1 $P,Q$ then there exists a polynomial $R$ of degree 1 which generates $P$ and $Q$. Time allowed for this problem was 75 minutes.

An ordered quadruple $(y_1,y_2,y_3,y_4)$ is $\textbf{quadratic}$ if there exist real numbers $a$, $b$, and $c$ such that \[y_n=an^2+bn+c\] for $n=1,2,3,4$. Prove that if $16$ numbers are placed in a $4\times 4$ grid such that all four rows are quadratic and the first three columns are also quadratic then the fourth column must also be quadratic. [i](We say that a row is quadratic if its entries, in order, are quadratic. We say the same for a column.)[/i] [asy] size(100); defaultpen(linewidth(0.8)); for(int i=0;i<=4;i=i+1) draw((i,0)--(i,4)); for(int i=0;i<=4;i=i+1) draw((0,i)--(4,i)); [/asy]

Susana and Brenda play a game writing polynomials on the board. Susana starts and they play taking turns. 1) On the preparatory turn (turn 0), Susana choose a positive integer $n_0$ and writes the polynomial $P_0(x)=n_0$. 2) On turn 1, Brenda choose a positive integer $n_1$, different from $n_0$, and either writes the polynomial $$P_1(x)=n_1x+P_0(x) \textup{ or } P_1(x)=n_1x-P_0(x)$$ 3) In general, on turn $k$, the respective player chooses an integer $n_k$, different from $n_0, n_1, \ldots, n_{k-1}$, and either writes the polynomial $$P_k(x)=n_kx^k+P_{k-1}(x) \textup{ or } P_k(x)=n_kx^k-P_{k-1}(x)$$ The first player to write a polynomial with at least one whole whole number root wins. Find and describe a winning strategy.

Egor and Igor take turns (Igor starts) replacing the coefficients of the polynomial \[a_{99}x^{99} + \cdots + a_1x + a_0\]with non-zero integers. Egor wants the polynomial to have as many different integer roots as possible. What is the largest number of roots he can always achieve?

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $P(x) = x^2 + rx + s$ be a polynomial with real coefficients. Suppose $P(x)$ has two distinct real roots, both of which are less than $-1$ and the difference between the two is less than $2$. Prove that $P(P(x)) > 0$ for all real $x$.