Found problems: 4275
Find all real solutions of the system of equations:
\[\sum^n_{k=1} x^i_k = a^i\] for $i = 1,2, \ldots, n.$
Find all polynomials $P,Q\in \Bbb{Q}\left [ x \right ]$ such that
$$P(x)^3+Q(x)^3=x^{12}+1.$$
Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1$. Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b$. Find the sum of all possible values of $(a+b)^2$.
Determine all 2nd degree polynomials with integer coefficients of the form $P(X)=aX^{2}+bX+c$, that satisfy: $P(a)=b$, $P(b)=a$, with $a\neq b$.
Paca-Vaca decided to note every day a single quadratic polynomial of the form $x^2+ax+b$, where $a$ and $b$ are positive integers, less or equal than $100$. He follows the rule that the polynomial he writes must not have any common roots with the polynomials previously noted.
What is the maximum amount of days Paca-Vaca can follow this plan?
Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.
There are $2024$ points of general position marked on the coordinate plane (i.e., points among which there are no three lying on the same straight line). Is there a polynomial of two variables $f(x,y)$ a) of degree $2025$; b) of degree $2024$ such that it equals to zero exactly at these marked points?
[i]Proposed by Navid Safaei[/i]
Consider the regular $1987$-gon $A_1A_2 . . . A_{1987}$ with center $O$. Show that the sum of vectors belonging to any proper subset of $M = \{OA_j | j = 1, 2, . . . , 1987\}$ is nonzero.
Let $a_1,...,a_n$ be $n$ real numbers. If for each odd positive integer $k\leqslant n$ we have $a_1^k+a_2^k+\ldots+a_n^k=0$, then for each odd positive integer $k$ we have $a_1^k+a_2^k+\ldots+a_n^k=0$.
[i]Proposed by M. Didin[/i]
Let $n$ be a positive integer. Let $a,b,x$ be real numbers, with $a \neq b$ and let $M_n$ denote the $2n x 2n $ matrix whose $(i,j)$ entry $m_{ij}$ is given by
$m_{ij}=x$ if $i=j$,
$m_{ij}=a$ if $i \not= j$ and $i+j$ is even,
$m_{ij}=b$ if $i \not= j$ and $i+j$ is odd.
For example
$ M_2=\begin{vmatrix}x& b& a & b\\ b& x & b &a\\ a
& b& x & b\\ b & a & b & x \end{vmatrix}$.
Express $\lim_{x\to\ 0} \frac{ det M_n}{ (x-a)^{(2n-2)} }$ as a polynomial in $a,b $ and $n$ .
P.S. How write in latex $m_{ij}=...$ with symbol for the system (because is multiform function?)
Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as
\begin{align*}
(x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z)
\end{align*}
with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.
Let $ n$ be a positive integer and $ a_{1}, \ldots, a_{n}$ be arbitrary integers. Suppose that a function $ f: \mathbb{Z}\to \mathbb{R}$ satisfies $ \sum_{i=1}^{n}f(k+a_{i}l) = 0$ whenever $ k$ and $ l$ are integers and $ l \ne 0$. Prove that $ f = 0$.
Let $p(x)$ be a polynomial with integer coefficients such that both equations $p(x)=1$ and $p(x)=3$ have integer solutions. Can the equation $p(x)=2$ have two different integer solutions?
Can the polynomials $x^{5}-x-1$ and $x^{2}+ax+b$ , where $a,b\in Q$, have common complex roots?
Determine all integers $a$ for which the equation \[x^{2}+axy+y^{2}=1\] has infinitely many distinct integer solutions $x, \;y$.
If $ a$, $ b$, $ c$, and $ d$ are the solutions of the equation $ x^4 \minus{} bx \minus{} 3 \equal{} 0$, then an equation whose solutions are
\[ \frac {a \plus{} b \plus{} c}{d^2}, \frac {a \plus{} b \plus{} d}{c^2}, \frac {a \plus{} c \plus{} d}{b^2}, \frac {b \plus{} c \plus{} d}{a^2}
\]is
$ \textbf{(A)}\ 3x^4 \plus{} bx \plus{} 1 \equal{} 0\qquad \textbf{(B)}\ 3x^4 \minus{} bx \plus{} 1 \equal{} 0\qquad \textbf{(C)}\ 3x^4 \plus{} bx^3 \minus{} 1 \equal{} 0$
$ \textbf{(D)}\ 3x^4 \minus{} bx^3 \minus{} 1 \equal{} 0\qquad \textbf{(E)}\ \text{none of these}$
We define the recursive polynomial $T_n(x)$ as follows:
$T_0(x)=1$
$T_1(x)=x$
$T_{n+1}(x)=2xT_n(x)+T_{n-1}(x)$ $\forall n \in \mathbb N$.
[b]a)[/b] find $T_2(x),T_3(x),T_4(x)$ and $T_5(x)$.
[b]b)[/b] find all the roots of the polynomial $T_n(x)$ $\forall n \in \mathbb N$.
[i]Proposed by Morteza Saghafian[/i]
Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.
Let the polynomial $P(x) = a_nx^n+a_{n-1}x^{n-1}+...+a_0$ has at least one real root and $a_0 \ne 0$. Prove that, consequently crossing out the monomials in the notation $P(x)$ in some order, we can obtain the number $a_0$ from it so that each intermediate polynomial also has at least one real root.
Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$.
[i]Proposed by Michael Kural[/i]
For each positive integer $ m > 1$, let $ P(m)$ denote the greatest prime factor of $ m$. For how many positive integers $ n$ is it true that both $ P(n) \equal{} \sqrt{n}$ and $ P(n \plus{} 48) \equal{} \sqrt{n \plus{} 48}$?
$ \textbf{(A)}\ 0\qquad
\textbf{(B)}\ 1\qquad
\textbf{(C)}\ 3\qquad
\textbf{(D)}\ 4\qquad
\textbf{(E)}\ 5$
Find all values of parameters $a,b$ for which the polynomial
$$x^4+(2a+1)x^3+(a-1)^2x^2+bx+4$$can be written as a product of two monic quadratic polynomials $\Phi(x)$ and $\Psi(x)$, such that the equation $\Psi(x)=0$ has two distinct roots $\alpha,\beta$ which satisfy $\Phi(\alpha)=\beta$ and $\Phi(\beta)=\alpha$.
The polynomial $P$ of degree $n$ satisfies $P(k) = \frac{k}{k +1}$ for $k = 0,1,2,...,n$. Find $P(n+1)$.
There are two given different polynomials $P(x),Q(x)$ with real coefficients such that $P(Q(x))=Q(P(x))$. Prove that $\forall n\in \mathbb{Z_{+}}$ polynomial:
\[\underbrace{P(P(\ldots P(P}_{n}(x))\ldots))- \underbrace{Q(Q(\ldots Q(Q}_{n}(x))\ldots))\]
is divisible by $P(x)-Q(x)$.
Call a polynomial $p(x)$ with positive integer roots [i]corrupt[/i] if there exists an integer that cannot be expressed as a sum of (not necessarily positive) multiples of its roots. The polynomial $A(x)$ is monic, corrupt, and has distinct roots. As well, $A(0)$ has $7$ positive divisors. Find the least possible value of $|A(1)|$.