Found problems: 4275
Let $P_c(x)=x^4+ax^3+bx^2+cx+1$ and $Q_c(x)=x^4+cx^3+bx^2+ax+1$ with $a,b$ real numbers, $c \in \{1,2, \dots, 2017\}$ an integer and $a \ne c$. Define $A_c=\{\alpha | P_c(\alpha)=0\}$ and $B_c=\{\beta | P(\beta)=0\}$.
(a) Find the number of unordered pairs of polynomials $P_c(x), Q_c(x)$ with exactly two common roots.
(b) For any $1 \le c \le 2017$, find the sum of the elements of $A_c \Delta B_c$.
Show that for any real numbers $a_{3},a_{4},...,a_{85}$, not all the roots of the equation $a_{85}x^{85}+a_{84}x^{84}+...+a_{3}x^{3}+3x^{2}+2x+1=0$ are real.
Find the smallest number $n$ such that there exist polynomials $f_1, f_2, \ldots , f_n$ with rational coefficients satisfying \[x^2+7 = f_1\left(x\right)^2 + f_2\left(x\right)^2 + \ldots + f_n\left(x\right)^2.\]
[i]Proposed by Mariusz Skałba, Poland[/i]
We are given a real number $a$, not equal to $0$ or $1$. Sacho and Deni play the following game. First is Sasho and then Deni and so on (they take turns). On each turn, a player changes one of the “*” symbols in the equation:
\[*x^4+*x^3+*x^2+*x^1+*=0\]
with a number of the type $a^n$, where $n$ is a whole number. Sasho wins if at the end the equation has no real roots, Deni wins otherwise. Determine (in term of $a$) who has a winning strategy
Prove the following statement:
If a polynomial $p(x) = x^3 + Ax^2 + Bx +C$ has three real positve roots at least two of which are distinct, then $A^2 +B^2 +18C > 0$.
Let $f(x)$ be a polynomial with integer coefficients. We assume that there exists a positive integer $k$ and $k$ consecutive integers $n, n+1, ... , n+k -1$ so that none of the numbers $f(n), f(n+ 1),... , f(n + k - 1)$ is divisible by $k$.
Show that the zeroes of $f(x)$ are not integers.
Find the sum of the real roots of the polynomial \[ \prod_{k=1}^{100} \left( x^2-11x+k \right) = \left( x^2-11x+1 \right)\left( x^2-11x+2 \right)\dots\left(x^2-11x+100\right). \][i]Proposed by Evan Chen[/i]
Let $Q$ be a quadratic polynomial. If the sum of the roots of $Q^{100}(x)$ (where $Q^i(x)$ is defined by $Q^1(x)=Q(x)$, $Q^i(x)=Q(Q^{i-1}(x))$ for integers $i\geq 2$) is $8$ and the sum of the roots of $Q$ is $S$, compute $|\log_2(S)|$.
Let $ A$ and $ B$ be the endpoints of a semicircular arc of radius $ 2$. The arc is divided into seven congruent arcs by six equally spaced points $ C_1,C_2,\ldots,C_6$. All chords of the form $ \overline{AC_i}$ or $ \overline{BC_i}$ are drawn. Let $ n$ be the product of the lengths of these twelve chords. Find the remainder when $ n$ is divided by $ 1000$.
Fix a real polynomial $P$ with degree at least $1$, and a real number $c$. Prove that there exist a real number $k$ such that for all reals $a$ and $b$, $$P(a)+P(b)=c \quad \Rightarrow \quad |a+b|<k$$
[i]Proposed by Wong Jer Ren[/i]
Find the roots of $6x^4+17x^3+7x^2-8x-4$
Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$.
[i]Nanang Susyanto, Jogjakarta[/i]
Let $f$ be a polynomial with real coefficients of degree $n$. Suppose that $\displaystyle \frac{f(x)-f(y)}{x-y}$ is an integer for all $0 \leq x<y \leq n$. Prove that $a-b | f(a)-f(b)$ for all distinct integers $a,b$.
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have :
$$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$
Who has the winning strategy.
Proposed by [i]Alireza Haghi[/i]
Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]
A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?
Find all real numbers $a$ for which the equation $x^2a- 2x + 1 = 3 |x|$ has exactly three distinct real solutions in $x$.
Let $n\ge 3$ be a positive integer. Prove that a polynomial of the form
\[x^n+a_{n-3}x^{n-3}+a_{n-4}x^{n-4}+\ldots +a_1x+a_0,\]
where at least one of the real coefficients $a_0,a_1,\ldots ,a_{n-3}$ is nonzero, cannot have all real roots.
Determine all real values of the parameter $a$ for which the equation
\[16x^4 -ax^3 + (2a + 17)x^2 -ax + 16 = 0\]
has exactly four distinct real roots that form a geometric progression.
How many real roots does the polynomial $x^5 + x^4 - x^3 - x^2 - 2x - 2$ have?
$
\textbf{a)}\ 1
\qquad\textbf{b)}\ 2
\qquad\textbf{c)}\ 3
\qquad\textbf{d)}\ 4
\qquad\textbf{e)}\ \text{None of above}
$
Find all pairs of polynomials $(p, q)$ with integer coefficients that satisfy the equation $$p(x^2) + q(x^2) = p(x)q(x)$$ such that $p$ is of degree $n$ and has $n$ nonnegative real roots (with multiplicity).
Quadratic polynomials $P(x)$ and $Q(x)$ have leading coefficients of $2$ and $-2$, respectively. The graphs of both polynomials pass through the two points $(16,54)$ and $(20,53)$. Find ${P(0) + Q(0)}$.
Polynomial $P(x)$ with degree $n \geq 3$ has $n$ real roots $x_1 < x_2 < x_3 <...< x_n$, such that $x_2-x_1<x_3-x_2<....<x_n-x_{n-1}$. Prove that the maximum of the function $y=|P(x)|$ where $x$ is on the interval $[ x_1, x_n ]$, is in the interval $[x_n-1, x_n]$.
Let
\[f = X^{n}+a_{n-1}X^{n-1}+\ldots+a_{1}X+a_{0}\]
be an integer polynomial of degree $n \geq 3$ such that $a_{k}+a_{n-k}$ is even for all $k \in \overline{1,n-1}$ and $a_{0}$ is even.
Suppose that $f = gh$, where $g,h$ are integer polynomials and $\deg g \leq \deg h$ and all the coefficients of $h$ are odd.
Prove that $f$ has an integer root.