Found problems: 3597
2011 Miklós Schweitzer, 5
Let n, k be positive integers. Let $f_a(x) := ||x - a||^{2n}$ , where the vectors $x = (x_1, ..., x_k) , a\in R^k$ , and ||·|| is the Euclidean norm. Let the vector space $Q_{n, k}$ be generated by the functions $f_a$ ($a\in R^k$). What is the largest integer N for which $Q_{n, k}$ contains all polynomials of $x_1, ..., x_k$ whose total degree is at most N?
Oliforum Contest III 2012, 2
Show that for every polynomial $f(x)$ with integer coefficients, there exists a integer $C$ such that the set
$\{n \in Z :$ the sum of digits of $f(n)$ is $C\}$ is not finite.
1971 All Soviet Union Mathematical Olympiad, 157
a) Consider the function $$f(x,y) = x^2 + xy + y^2$$ Prove that for the every point $(x,y)$ there exist such integers $(m,n)$, that $$f((x-m),(y-n)) \le 1/2$$
b) Let us denote with $g(x,y)$ the least possible value of the $f((x-m),(y-n))$ for all the integers $m,n$. The statement a) was equal to the fact $g(x,y) \le 1/2$.
Prove that in fact, $$g(x,y) \le 1/3$$
Find all the points $(x,y)$, where $g(x,y)=1/3$.
c) Consider function $$f_a(x,y) = x^2 + axy + y^2 \,\,\, (0 \le a \le 2)$$
Find any $c$ such that $g_a(x,y) \le c$.
Try to obtain the closest estimation.
2016 Tournament Of Towns, 6
Petya and Vasya play the following game. Petya conceives a polynomial $P(x)$ having integer coefficients. On each move, Vasya pays him a ruble, and calls an integer $a$ of his choice, which has not yet been called by him. Petya has to reply with the number of distinct integer solutions of the equation $P(x)=a$. The game continues until Petya is forced to repeat an answer. What minimal amount of rubles must Vasya pay in order to win?
[i](Anant Mudgal)[/i]
(Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])
PEN E Problems, 14
Prove that there do not exist polynomials $ P$ and $ Q$ such that
\[ \pi(x)\equal{}\frac{P(x)}{Q(x)}\]
for all $ x\in\mathbb{N}$.
2017 Balkan MO Shortlist, A5
Consider integers $m\ge 2$ and $n\ge 1$.
Show that there is a polynomial $P(x)$ of degree equal to $n$ with integer coefficients such that $P(0),P(1),...,P(n)$ are all perfect powers of $m$ .
2007 China Team Selection Test, 2
After multiplying out and simplifying polynomial $ (x \minus{} 1)(x^2 \minus{} 1)(x^3 \minus{} 1)\cdots(x^{2007} \minus{} 1),$ getting rid of all terms whose powers are greater than $ 2007,$ we acquire a new polynomial $ f(x).$ Find its degree and the coefficient of the term having the highest power. Find the degree of $ f(x) \equal{} (1 \minus{} x)(1 \minus{} x^{2})...(1 \minus{} x^{2007})$ $ (mod$ $ x^{2008}).$
2017 Romanian Master of Mathematics, 2
Determine all positive integers $n$ satisfying the following condition: for every monic polynomial $P$ of degree at most $n$ with integer coefficients, there exists a positive integer $k\le n$ and $k+1$ distinct integers $x_1,x_2,\cdots ,x_{k+1}$ such that \[P(x_1)+P(x_2)+\cdots +P(x_k)=P(x_{k+1})\].
[i]Note.[/i] A polynomial is [i]monic[/i] if the coefficient of the highest power is one.
2013 Romania Team Selection Test, 4
Let $k$ be a positive integer larger than $1$. Build an infinite set $\mathcal{A}$ of subsets of $\mathbb{N}$ having the following properties:
[b](a)[/b] any $k$ distinct sets of $\mathcal{A}$ have exactly one common element;
[b](b)[/b] any $k+1$ distinct sets of $\mathcal{A}$ have void intersection.
2011 AIME Problems, 15
For some integer $m$, the polynomial $x^3-2011x+m$ has the three integer roots $a$, $b$, and $c$. Find $|a|+|b|+|c|$.
1983 IMO Shortlist, 10
Let $p$ and $q$ be integers. Show that there exists an interval $I$ of length $1/q$ and a polynomial $P$ with integral coefficients such that
\[ \left|P(x)-\frac pq \right| < \frac{1}{q^2}\]for all $x \in I.$
1970 IMO Shortlist, 11
Let $P,Q,R$ be polynomials and let $S(x) = P(x^3) + xQ(x^3) + x^2R(x^3)$ be a polynomial of degree $n$ whose roots $x_1,\ldots, x_n$ are distinct. Construct with the aid of the polynomials $P,Q,R$ a polynomial $T$ of degree $n$ that has the roots $x_1^3 , x_2^3 , \ldots, x_n^3.$
2010 Contests, 4
Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions:
(i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers);
(ii) $|a_1-b_1|+|a_2-b_2|=2010$;
(iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$;
(iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$.
[i]Massimo Gobbino, Italy[/i]
1984 IMO Longlists, 31
Let $f_1(x) = x^3+a_1x^2+b_1x+c_1 = 0$ be an equation with three positive roots $\alpha>\beta>\gamma > 0$. From the equation $f_1(x) = 0$, one constructs the equation $f_2(x) = x^3 +a_2x^2 +b_2x+c_2 = x(x+b_1)^2 -(a_1x+c_1)^2 = 0$. Continuing this process, we get equations $f_3,\cdots, f_n$. Prove that
\[\lim_{n\to\infty}\sqrt[2^{n-1}]{-a_n} = \alpha\]
2011 Graduate School Of Mathematical Sciences, The Master Cource, The University Of Tokyo, 1
Let $A=\left(
\begin{array}{ccc}
1 & 1& 0 \\
0 & 1& 0 \\
0 &0 & 2
\end{array}
\right),\ B=\left(
\begin{array}{ccc}
a & 1& 0 \\
b & 2& c \\
0 &0 & a+1
\end{array}
\right)\ (a,\ b,\ c\in{\mathbb{C}}).$
(1) Find the condition for $a,\ b,\ c$ such that ${\text{rank} (AB-BA})\leq 1.$
(2) Under the condition of (1), find the condition for $a,\ b,\ c$ such that $B$ is diagonalizable.
2023 Indonesia TST, N
Let $P(x)$ and $Q(x)$ be polynomials of degree $p$ and $q$ respectively such that every coefficient is $1$ or $2023$. If $P(x)$ divides $Q(x)$, prove that $p+1$ divides $q+1$.
2017 All-Russian Olympiad, 2
$a,b,c$ - different natural numbers. Can we build quadratic polynomial $P(x)=kx^2+lx+m$, with $k,l,m$ are integer, $k>0$ that for some integer points it get values $a^3,b^3,c^3$ ?
2024 Belarusian National Olympiad, 11.2
$29$ quadratic polynomials $f_1(x), \ldots, f_{29}(x)$ and $15$ real numbers $x_1<x_2<\ldots<x_{15}$ are given. Prove that for some two given polynomials $f_i(x)$ and $f_j(x)$ the following inequality holds: $$\sum_{k=1}^{14} (f_i(x_{k+1})-f_i(x_k))(f_j(x_{k+1})-f_j(x_k))>0$$
[i]A. Voidelevich[/i]
2013 Putnam, 3
Suppose that the real numbers $a_0,a_1,\dots,a_n$ and $x,$ with $0<x<1,$ satisfy \[\frac{a_0}{1-x}+\frac{a_1}{1-x^2}+\cdots+\frac{a_n}{1-x^{n+1}}=0.\] Prove that there exists a real number $y$ with $0<y<1$ such that \[a_0+a_1y+\cdots+a_ny^n=0.\]
2013 Iran Team Selection Test, 3
For nonnegative integers $m$ and $n$, define the sequence $a(m,n)$ of real numbers as follows. Set $a(0,0)=2$ and for every natural number $n$, set $a(0,n)=1$ and $a(n,0)=2$. Then for $m,n\geq1$, define \[ a(m,n)=a(m-1,n)+a(m,n-1). \] Prove that for every natural number $k$, all the roots of the polynomial $P_{k}(x)=\sum_{i=0}^{k}a(i,2k+1-2i)x^{i}$ are real.
2017 Taiwan TST Round 1, 5
Let $n$ be an odd number larger than 1, and $f(x)$ is a polynomial with degree $n$ such that $f(k)=2^k$ for $k=0,1,\cdots,n$. Prove that there is only finite integer $x$ such that $f(x)$ is the power of two.
1966 Miklós Schweitzer, 8
Prove that in Euclidean ring $ R$ the quotient and remainder are always uniquely determined if and only if $ R$ is a polynomial ring over some field and the value of the norm is a strictly monotone function of the degree of the polynomial. (To be precise, there are two trivial cases: $ R$ can also be a field or the null ring.)
[i]E. Fried[/i]
2007 All-Russian Olympiad, 2
Given polynomial $P(x) = a_{0}x^{n}+a_{1}x^{n-1}+\dots+a_{n-1}x+a_{n}$. Put $m=\min \{ a_{0}, a_{0}+a_{1}, \dots, a_{0}+a_{1}+\dots+a_{n}\}$. Prove that $P(x) \ge mx^{n}$ for $x \ge 1$.
[i]A. Khrabrov [/i]
1999 Brazil Team Selection Test, Problem 2
If $a,b,c,d$ are Distinct Real no. such that
$a = \sqrt{4+\sqrt{5+a}}$
$b = \sqrt{4-\sqrt{5+b}}$
$c = \sqrt{4+\sqrt{5-c}}$
$d = \sqrt{4-\sqrt{5-d}}$
Then $abcd = $
2005 Germany Team Selection Test, 2
For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.