Questions tagged [polynomials]

For both basic and advanced questions on polynomials in any number of variables, including, but not limited to solving for roots, factoring, and checking for irreducibility.

Usually, polynomials are introduced as expressions of the form $\sum_{i=0}^dc_ix^i$ such as $15x^3 - 14x^2 + 8$. Here, the numbers are called coefficients, the $x$'s are the variables or indeterminates of the polynomial, and $d$ is known as the degree of the polynomial. In general the coefficients may be taken from any ring $R$ and any finite number of variables is allowed. The set of all polynomials in $n$ variables $X_1,\ldots,X_n$ over a ring $R$ is denoted by $R[X_1,\ldots,X_n]$. Strictly speaking this is a formal sum, because the variables do not represent any value. Nevertheless, the variables of a polynomial obey the usual arithmetic laws in a ring (like commutativity and distributivity). This makes $R[X_1,\ldots,X_n]$ a ring itself. One should note that $R[X_1][X_2]=R[X_1,X_2]$. This idea can be extended to $R[X_1,\ldots,X_n]$ in a very natural way.

An expression of the form $rX_1^{i_1}X_2^{i_2}\cdots X_n^{i_n}$ ($r\in R$) is called a term (of the polynomial). Polynomials are defined to have only finitely many terms. An expression with infinitely many different terms is generally not considered to be a polynomial, but a (formal) power series in one or more variables.

When $P\in R[X]$, $P(x)$ is the evaluation of $P$ at $x$ (pronounced $P$ of $x$, or simply $Px$). Here $x$ does not necessarily have to be an element of $R$. For $P(x)$ to be properly defined for an $x$ in some ring $S$ we need:

  • a homomorphism $\phi:R\to S$
  • the image of all coefficients of $P$ under $\phi$ should commute with $x$.

Evaluation is now simply performed by replacing all coefficients $r_i$ of $P$ by $\phi(r_i)$ and all appearances of $X$ by $x$. This quite naturally gives an expression that is well defined as an element of $S$. The concept of evaluation is naturally extended to $R[X_1,\ldots,X_n]$.

26755 questions
4
votes
1 answer

Polynomial rings and prime numbers

Let $f\in \mathbb{Q}[x]$ be a polynomial of degree $n>0$. Let $p_1, \dots , p_{n+1}$ be distinct prime numbers. Show that there exists a non-zero polynomial $g\in \mathbb{Q}[x]$ such that $fg=\sum_{i=1}^{n+1} c_ix^{p_i}$ with $c_i\in…
am_11235...
  • 2,142
4
votes
3 answers

If $x^2+x+1 = 0$ then find the value of $x^{1999}+x^{2000}$?

If $x^2+x+1 = 0$ then find the value of $x^{1999}+x^{2000}$. I first tried finding the solution of the given equation and then substituting it in the expression whose value we have to find but I wasn't able to simplify it. In a different approach…
4
votes
1 answer

Product of Roots of a $4$th-degree Polynomial

Problem: Let $a$, $b$, $c$, and $d$ be distinct real numbers such that \begin{align*} a &= \sqrt{4 + \sqrt{5 + a}}, \\ b &= \sqrt{4 - \sqrt{5 + b}}, \\ c &= \sqrt{4 + \sqrt{5 - c}}, \\ d &= \sqrt{4 - \sqrt{5 - d}}. \end{align*}Compute $abcd$. I…
JenkinsMa
  • 415
4
votes
1 answer

Getting a bound on the coefficients of the factor polynomial

Suppose $f(x):=a_0+a_1x+\cdots+a_nx^n$ is a polynomial in $\mathbb{Z}[x]$ and $|a_i|\leq M$ for each $i=0,\ldots ,n$. Now suppose $g(x)$ is a factor of $f(x)$ in $\mathbb{Z}[x]$, then is it possible to get a bound on the coefficients of $g(x)$ in…
pritam
  • 10,157
4
votes
0 answers

Upper bound on number of roots of a polynomial system

In the case of univariate polynomial it is possible to (upper) bound the number of roots in the given (real) interval, see Descartes' rule of signs, Budan's theorem, Vincent's theorem, Sturm's theorem, ... Is there anything similar for a system of…
4
votes
1 answer

$Q(x)$ is a monic polynomial with integer coefficients of degree $12$ such that there exists an integer polynomial $P(x)$ satisfying $Q(x)P(x)=Q(x^2)$

$Q(x)$ is a monic polynomial with integer coefficients of degree $12$ such that there exists an integer polynomial $P(x)$ satisfying $Q(x)P(x)=Q(x^2)$. Find the number of all such polynomials $Q(x)$. The idea which came to my mind was considering…
4
votes
2 answers

Transformation of Roots for a Cubic Polynomial

Consider $$x^3 + px + q = 0$$ with roots $ \alpha, \beta. \gamma$ We want to find the degree 3 polynomial that has roots : $$ \frac{\alpha\beta}{\gamma}, \frac{ \alpha\gamma}{\beta}, \frac{ \beta\gamma }{\alpha} $$ My attempt so far: $$\frac{…
4
votes
2 answers

If $ax^2 +bxy+cy^2+5x-2y+3$ divided by $x-y+1$ has remainder $0$, determine $a$, $b$, and $c$.

If $ax^2 +bxy+cy^2+5x-2y+3$ divided by $x-y+1$ has remainder $0$, determine $a$, $b$, and $c$. I do not know how to approach this problem and would appreciate advice how to proceed.
Ledi
  • 41
4
votes
1 answer

Infinite variable polynomial

I'm curious as to how to construct an infinite variable polynomial. Is there an nice formulation of such a thing? I've attempted using functions and functionals to construct one, but that didn't lead anywhere. I need it to find a separatrix for a…
4
votes
1 answer

Rationals that aren't in the image of polynomials

Consider multiple polynomials with coefficients in $\mathbb Z$ and of degree at least 2 (thanks Moos): $g_1,g_2..g_i$. How can I go about showing that there are an infinite amount of rationals number $t$ so that for any $s$ in $\mathbb Q$,…
user157036
4
votes
3 answers

Polynomial roots problems.

$$ X^5-55X+21$$ Prove that the given polynomial has 2 roots which satisfy the condition: $$X_1X_2=1$$ and find them. I have tried to make use of Viette's relations ,but couldnt get to a satisfying result.
4
votes
1 answer

The biggest possible degree of a polynomial given a condition

Let $P(x) \in R[x]$ be a polynomial with real coefficients such that $$(\forall n \in \mathbb N)(\exists q \in \mathbb Q)(P(q)=n)$$ What's the biggest possible value of $\deg P$? ($\deg P$ is the degree of polynomial $P$) I have literally no clue as…
windircurse
  • 1,894
4
votes
2 answers

Express $1/(x-1)$ in the form $ax^2+bx+c$

Let $x$ be a root of $f=t^3-t^2+t+2 \in \mathbb{Q}[t]$ and $K=\mathbb{Q}(x)$. Express $\frac{1}{x-1}$ in the form $ax^2+bx+c$, where $a,b,c\in \mathbb{Q}$. I have proved that $f$ is the minimal polynomial of $x$ over $\mathbb{Q}$ but I am stuck…
user zero
  • 699
4
votes
1 answer

Bounding the outputs of a polynomial

Let $p(x)$ be a polynomial with integer coefficients and $k\geq 6$ a positive integer. Given that $x_1,x_2,\ldots,x_k$ are distinct integers such $p(x_1),p(x_2),\ldots,p(x_{k})\in\{1,2,\ldots,k-1\}$, prove that $p(x_1)=p(x_2)=\cdots=p(x_k)$. Not…
math_lover
  • 5,826
4
votes
2 answers

Find polynomials $f(x),g(x)$ such that $f(x)p(x) + g(x)q(x) = 2x^2 + 6x +2$

Let $$p(x) = x^4 + 7x^3 + 14x^2 + 7x+1 $$$$q(x) = x^4 +10x^3 + 23x^2 + 10x+1$$ Find polynomials $f(x),g(x)$ with rational coefficients such that $$f(x)p(x) + g(x)q(x) = 2x^2 + 6x +2$$ I totally have no idea to solve this problem... Please help me…
Nhay
  • 727