Find all triples $(a,b,c)$ of real numbers such that the following system holds: $$\begin{cases} a+b+c=\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \\a^2+b^2+c^2=\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}\end{cases}$$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

Problem: Find all polynomials satisfying the equation $ f(x^2) = (f(x))^2 $ for all real numbers x. I'm not exactly sure where to start though it doesn't look too difficult. Thanks!

Prove that there exist infinitely many positive integers $d$ such that we can find a polynomial $P\in\mathbb{Z}[x]$ of degree $d$ and $N\in\mathbb{N}$ such that for all integers $x>N$ and any prime $p$, we have $$\nu_p(P(x)^3+3P(x)^2-3)<\frac{d\cdot\log(x)}{2024^{2024}}.$$ [i]Proposed by Marius Cerlat[/i]

Let $f(x)$ be a cubic polynomial with rational coefficients. If the graph of $f(x)$ is tangent to the $x$ axis, prove that the roots of $f(x)$ are all rational.

The players Alfred and Bertrand put together a polynomial $x^n + a_{n-1}x^{n- 1} +... + a_0$ with the given degree $n \ge 2$. To do this, they alternately choose the value in $n$ moves one coefficient each, whereby all coefficients must be integers and $a_0 \ne 0$ must apply. Alfred's starts first . Alfred wins if the polynomial has an integer zero at the end. (a) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the right to the left, i.e. for $j = 0, 1,. . . , n - 1$, be determined? (b) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the left to the right, i.e. for $j = n -1, n - 2,. . . , 0$, be determined? (Theresia Eisenkölbl, Clemens Heuberger)

The three roots of the cubic $ 30 x^3 \minus{} 50x^2 \plus{} 22x \minus{} 1$ are distinct real numbers between $ 0$ and $ 1$. For every nonnegative integer $ n$, let $ s_n$ be the sum of the $ n$th powers of these three roots. What is the value of the infinite series \[ s_0 \plus{} s_1 \plus{} s_2 \plus{} s_3 \plus{} \dots \, ?\]

On a faded piece of paper it is possible to read the following: \[(x^2 + x + a)(x^{15}- \cdots ) = x^{17} + x^{13} + x^5 - 90x^4 + x - 90.\] Some parts have got lost, partly the constant term of the first factor of the left side, partly the majority of the summands of the second factor. It would be possible to restore the polynomial forming the other factor, but we restrict ourselves to asking the following question: What is the value of the constant term $a$? We assume that all polynomials in the statement have only integer coefficients.

Let $P$ be a polynomial such that $(x-4)P(2x) = 4(x-1)P(x)$, for every real $x$. If $P(0) \neq 0$, what is the degree of $P$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $f$ be a function on defined on $|x|<1$ such that $f\left (\tfrac1{10}\right )$ is rational and $f(x)= \sum_{i=1}^{\infty} a_i x^i $ where $a_i\in{\{0,1,2,3,4,5,6,7,8,9\}}$. Prove that $f$ can be written as $f(x)= \frac{p(x)}{q(x)}$ where $p(x)$ and $q(x)$ are polynomials with integer coefficients.

Let a polynomial $ P(x) \equal{} rx^3 \plus{} qx^2 \plus{} px \plus{} 1$ $ (r > 0)$ such that the equation $ P(x) \equal{} 0$ has only one real root. A sequence $ (a_n)$ is defined by $ a_0 \equal{} 1, a_1 \equal{} \minus{} p, a_2 \equal{} p^2 \minus{} q, a_{n \plus{} 3} \equal{} \minus{} pa_{n \plus{} 2} \minus{} qa_{n \plus{} 1} \minus{} ra_n$. Prove that $ (a_n)$ contains an infinite number of nagetive real numbers.

For arbitrary non-constant polynomials $f_1(x),\ldots,f_{2018}(x)\in\mathbb Z[x]$, is it always possible to find a polynomial $g(x)\in\mathbb Z[x]$ such that $$f_1(g(x)),\ldots,f_{2018}(g(x))$$are all reducible.

The teacher wrote on the blackboard quadratic polynomial $x^2 + 10x + 20$. Then in turn each student in the class either increased or decreased by $1$ either the coefficient of $x$ or the constant term. At the end the quadratic polynomial became $x^2+20x+10$. Is it true that at certain moment a quadratic polynomial with integer roots was on the board?

Prove that if the integers $a_{1}$, $a_{2}$, $\cdots$, $a_{n}$ are all distinct, then the polynomial \[(x-a_{1})^{2}(x-a_{2})^{2}\cdots (x-a_{n})^{2}+1\] cannot be expressed as the product of two nonconstant polynomials with integer coefficients.

For a given positive integer $n\ge 2$, suppose positive integers $a_i$ where $1\le i\le n$ satisfy $a_1<a_2<\ldots <a_n$ and $\sum_{i=1}^n \frac{1}{a_i}\le 1$. Prove that, for any real number $x$, the following inequality holds \[\left(\sum_{i=1}^n\frac{1}{a_i^2+x^2}\right)^2\le\frac{1}{2}\cdot\frac{1}{a_1(a_1-1)+x^2} \] [i]Li Shenghong[/i]

Find the number of degree $8$ polynomials $f (x)$ with nonnegative integer coefficients satisfying both $f (1) = 16$ and $f (-1) = 8$.

Three men, Alpha, Beta, and Gamma, working together, do a job in $6$ hours less time than Alpha alone, in $1$ hour less time than Beta alone, and in one-half the time needed by Gamma when working alone. Let $h$ be the number of hours needed by Alpha and Beta, working together to do the job. Then $h$ equals: $\text{(A)}\ \dfrac{5}{2}\qquad \text{(B)}\ \frac{3}{2}\qquad \text{(C)}\ \dfrac{4}{3}\qquad \text{(D)}\ \dfrac{5}{4}\qquad \text{(E)}\ \dfrac{3}{4}$

Let be three polynomials of degree two $ p_1,p_2,p_3\in\mathbb{R} [X] $ and the function $$ f:\mathbb{R}\longrightarrow\mathbb{R} ,\quad f(x)=\max\left( p_1(x),p_2(x),p_3(x)\right) . $$ Then, $ f $ is differentiable if and only if any of these three polynomials dominates the other two.

Let $D \subseteq \mathbb{C}$ be an open set containing the closed unit disk $\{z : |z| \leq 1\}$. Let $f : D \rightarrow \mathbb{C}$ be a holomorphic function, and let $p(z)$ be a monic polynomial. Prove that $$ |f(0)| \leq \max_{|z|=1} |f(z)p(z)| $$

Let $f \in \mathbb Z[X]$. For an $n \in \mathbb N$, $n \geq 2$, we define $f_n : \mathbb Z / n \mathbb Z \to \mathbb Z / n \mathbb Z$ through $f_n \left( \widehat x \right) = \widehat{f \left( x \right)}$, for all $x \in \mathbb Z$. (a) Prove that $f_n$ is well defined. (b) Find all polynomials $f \in \mathbb Z[X]$ such that for all $n \in \mathbb N$, $n \geq 2$, the function $f_n$ is surjective. [i]Bogdan Enescu[/i]

Find all second degree polynomials $P(x)$ such that for all $a \in\mathbb{R} , a \geq 1$, then $P(a^2+a) \geq a.P(a+1)$

Polynomial $ f\left(x\right)$ satisfies $ \left(x \minus{} 1\right)f\left(x \plus{} 1\right) \minus{} \left(x \plus{} 2\right)f\left(x\right) \equal{} 0$ for every $ x\in \Re$. If $ f\left(2\right) \equal{} 6$, $ f\left({\tfrac{3}{2}} \right) \equal{} ?$ $\textbf{(A)}\ -6 \qquad\textbf{(B)}\ 0 \qquad\textbf{(C)}\ \frac {3}{2} \qquad\textbf{(D)}\ \frac {15}{8} \qquad\textbf{(E)}\ \text{None}$

Let the polynomials \[P(x) = x^n + a_{n-1}x^{n-1 }+ \cdots + a_1x + a_0,\] \[Q(x) = x^m + b_{m-1}x^{m-1} + \cdots + b_1x + b_0,\] be given satisfying the identity $P(x)^2 = (x^2 - 1)Q(x)^2 + 1$. Prove the identity \[P'(x) = nQ(x).\]

Let $a_0 ,a_1 , \ldots, a_n$ be real numbers and let $f(x) =a_n x^n +\ldots +a_1 x +a_0.$ Suppose that $f(i)$ is an integer for all $i.$ Prove that $n! \cdot a_k$ is an integer for each $k.$

If it is known that the equation $$x^4+ax^3+2x^2+bx+1=0$$ has a (real) root, prove the inequality $$a^2+b^2 \ge 8.$$ (A Egorov)