For each polynomial $P(x)$ with real coefficients, define $P_0=P(0)$ and $P_j(x)=x^j\cdot P^{(j)}(x)$ where $P^{(j)}$ denotes the $j$-th derivative of $P$ for $j\geq 1$. Prove that there exists one unique sequence of real numbers $b_0, b_1, b_2, \dots$ such that for each polynomial $P(x)$ with real coefficients and for each $x$ real, we have $P(x)=b_0P_0+\sum_{k\geq 1}b_kP_k(x)=b_0P_0+b_1P_1(x)+b_2P_2(x)+\dots$

Find the number of nonzero terms of the polynomial $P(x)$ if $$x^{2018}+x^{2017}+x^{2016}+x^{999}+1=(x^4+x^3+x^2+x+1)P(x).$$

Find all the finite sequences with $ n$ consecutive natural numbers $ a_1, a_2,..., a_n$, with $ n\geq3$ such that $ a_1\plus{} a_2\plus{}...\plus{} a_n\equal{}2009$.

If for real numbers $x$ and $y$ holds $\left(x+\sqrt{1+y^2}\right)\left(y+\sqrt{1+x^2}\right)=1$ prove that $$\left(x+\sqrt{1+x^2}\right)\left(y+\sqrt{1+y^2}\right)=1$$

Two friends $A$ and $B$ must solve the following puzzle. Each of them receives a number from the set $\{1,2,…,250\}$, but they don’t see the number that the other received. The objective of each friend is to discover the other friend’s number. The procedure is as follows: each friend, by turns, announces various not necessarily distinct positive integers: first $A$ says a number, then $B$ says one, $A$ says a number again, etc., in such a way that the sum of all the numbers said is $20$. Demonstrate that there exists a strategy that $A$ and $B$ have previously agreed on such that they can reach the objective, no matter which number each one received at the beginning of the puzzle.

If $0\le x_k<k$, for any $k\in\{1,2,\ldots,n\}$, $m\in\mathbb R_{\ge2}$, then prove that $$\frac1{\sqrt[m]{(1-x_1)(2-x_2)\cdots(n-x_n)}}+\frac1{\sqrt[m]{(1+x_1)(2+x_2)\cdots(n+x_n)}}\ge\frac2{\sqrt[m]{n!}}$$ [i]Proposed by Dorin Mărghidanu[/i]

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$-plane intersect at exactly $3$ points? $ \textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad $

If $f$ is a polynomial, and $f(-2)=3$, $f(-1)=-3=f(1)$, $f(2)=6$, and $f(3)=5$, then what is the minimum possible degree of $f$?

Let $ABC$ be a triangle and let $P$ be a point in the plane of $ABC$ that is inside the region of the angle $BAC$ but outside triangle $ABC$. [b](a)[/b] Prove that any two of the following statements imply the third. [list] [b](i)[/b] the circumcentre of triangle $PBC$ lies on the ray $\stackrel{\to}{PA}$. [b](ii)[/b] the circumcentre of triangle $CPA$ lies on the ray $\stackrel{\to}{PB}$. [b](iii)[/b] the circumcentre of triangle $APB$ lies on the ray $\stackrel{\to}{PC}$.[/list] [b](b)[/b] Prove that if the conditions in (a) hold, then the circumcentres of triangles $BPC,CPA$ and $APB$ lie on the circumcircle of triangle $ABC$.

Determine all real values of parameter $p$ such that the equation \[|x-2|+|y-3|+y=p\] is an equation of a ray in the plane $xy.$

A sequence $(x_n)_{n= 1}^{\infty}$ satisfies $x_1 = 1$ and for each $n > 1, x_n = \pm (n-1)x_{n-1} \pm (n-2)x_{n-2} \pm ... \pm 2x_2 \pm x_1$. Prove that the signs ” $\pm$” can be chosen so that $x_n \ne 12$ holds only for finitely many $n$.

Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.

Prove that there doesn’t exist any prime $p$ such that every power of $p$ is a palindrome (a palindrome is a number that is read the same from the left as it is from the right; in particular, a number that ends in one or more zeros cannot be a palindrome).

The following method of approximate measurement is known for distances. Suppose, for example, that the observer is on the river bank at point $C$ in order to measure its width. To do this, he fixes point $A$ on the opposite bank so that the angle between the shoreline and the line $CA$ is close to the line. Then the observer pulls forward the right hand with the raised thumb, closes left eye and aligns the raised finger with point $A$. Next, opens the left eye, closes right and estimates the distance between the point on the opposite bank to which the finger points, and point $A$. Multiply this distance by $10$ and get the approximate value of the distance to point $A$, ie the width of the river. Justify this method of measuring distance. [hide=original wording]Відомий наступний спосіб наближеного вимірювання відстані. Нехай, наприклад, спостерігач знаходиться на березі річки у точці C і має на меті виміряти її ширину. Для цього він фіксує точку A на протилежному березі так, щоб кут між лінією берега і прямою CA був близьким до прямого. Потім спостерігач витягує вперед праву руку з піднятим вгору великим пальцем, заплющує ліве око і суміщає піднятий палець з точкою A. Далі, відкриває ліве око, заплющує праве і оцінює відстань між точкою на протилежному березі, на яку вказує палець, і точкою A. Цю відстань множить на 10 і отримує наближене значення відстані до точки A, тобто ширини річки. Обґрунтуйте цей спосіб вимірювання відстані.[/hide]

The quadratic equation $ x^2 \plus{} mx \plus{} n \equal{} 0$ has roots that are twice those of $ x^2 \plus{} px \plus{} m \equal{} 0$, and none of $ m,n,$ and $ p$ is zero. What is the value of $ n/p$? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 16$

Given a circle $S$ and its $121$ chords $P_i (i=1,2,\ldots,121)$, each with a point $A_i(i=1,2,\ldots,121)$ on it. Prove that there exists a point $X$ on the circumference of $S$ such that: there exist $29$ distinct indices $1\le k_1\le k_2\le\ldots\le k_{29}\le 121$, such that the angle formed by ${A_{k_j}}X$ and ${P_{k_j}}$ is smaller than $21$ degrees for every $j=1,2,\ldots,29$.

Julia and Hansol are having a math-off. Currently, Julia has one more than twice as many points as Hansol. If Hansol scores $6$ more points in a row, he will tie Julia’s score. How many points does Julia have?

If three of the roots of $x^4+ax^2+bx+c=0$ are $1$, $2$, and $3$, then the value of $a+c$ is: $\text{(A)}\ 35 \qquad \text{(B)}\ 24\qquad \text{(C)}\ -12\qquad \text{(D)}\ -61 \qquad \text{(E)}\ -63$

Let $m,n$ be positive integers. Find the minimum positive integer $N$ which satisfies the following condition. If there exists a set $S$ of integers that contains a complete residue system module $m$ such that $| S | = N$, then there exists a nonempty set $A \subseteq S$ so that $n\mid {\sum\limits_{x \in A} x }$.

Let be a sequence of real numbers $ \left( x_n \right)_{n\geqslant 0} $ with $ x_0\neq 0,1 $ and defined as $ x_{n+1}=x_n+x_n^{-1/x_0} . $ [b]a)[/b] Show that the sequence $ \left( x_n\cdot n^{-\frac{x_0}{1+x_0}} \right)_{n\geqslant 0} $ is convergent. [b]b)[/b] Prove that $ \inf_{x_0\neq 0,1} \lim_{n\to\infty } x_n\cdot n^{-\frac{x_0}{1+x_0}} =1. $

Solve the equation $$2(x-6)=\dfrac{x^2}{(1+\sqrt{x+1})^2}$$

Show that there exists a $10 \times 10$ table of distinct natural numbers such that if $R_i$ is equal to the multiplication of numbers of row $i$ and $S_i$ is equal to multiplication of numbers of column $i$, then numbers $R_1$, $R_2$, ... , $R_{10}$ make a nontrivial arithmetic sequence and numbers $S_1$, $S_2$, ... , $S_{10}$ also make a nontrivial arithmetic sequence. (A nontrivial arithmetic sequence is an arithmetic sequence with common difference between terms not equal to $0$).

Let $n\geq 5$ an integer and consider a regular $n$-gon. Initially, Nacho is situated in one of the vertices of the $n$-gon, in which he puts a flag. He will start moving clockwise. First, he moves one position and puts another flag, then, two positions and puts another flag, etcetera, until he finally moves $n-1$ positions and puts a flag, in such a way that he puts $n$ flags in total. ¿For which values of $n$, Nacho will have put a flag in each of the $n$ vertices?

Let $n$ be a fixed positive integer. How many ways are there to write $n$ as a sum of positive integers, \[n = a_1 + a_2 + \cdots a_k\] with $k$ an arbitrary positive integer and $a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1$? For example, with $n = 4$, there are four ways: $4$, $2 + 2$, $1 + 1 + 2$, $1 + 1 + 1 + 1$.