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
2
votes
0 answers

Coefficients of a product of polynomials of the form $1+x+\cdots+x^k$

I'm looking for the coefficients $a_0,\ldots,a_k$ of the polynomial $$f(x)=\prod_{i=1}^r(1+x+\cdots +x^{k_i-1})=\prod_{i=1}^r\frac{1-x^{k_i}}{1-x}$$ Since $f(1/x)=x^{-k}f(x)$ where $k = \deg(f)=\displaystyle\sum_{i=1}^r(k_i-1)$, I know that $a_j =…
tj_
  • 2,141
2
votes
1 answer

Solving the polynomial equation: $1+x^2-\frac{t}{x^{d-2}}=0$

I was attempting to solve the following equation for $x$: $$1+x^2-\frac{t}{x^{d-2}}=0$$ where $t\in\mathbb{R}_{+}$ and $d\in \mathbb{Z_{+}}$. Is it possible to obtain a general solution for such an equation?
2
votes
1 answer

For how many rational $x$ is $P(x)$ such that $54x^n+P(x)=315$?

Given an integer $n >2$,for how many different rational numbers $x$ does there exist a polynomial $P(x)$ of degree $n-1$ with $P(0)=0$,and with all integer coefficients,such that $54x^n+P(x)=315$ ? My effort From $P(0)$ I must have that $P(x)$…
Mr. Y
  • 2,637
2
votes
0 answers

If $Q(P(x), x)$ is the zero polynomial, then $Q(x, y) = (y - P(x))A(x, y)$ for some $A$

Let $Q(x, y)$ be a bivariate polynomial over some field $\mathbb{F}$, and $P(x)$ a univariate polynomial over $\mathbb{F}$ such that $Q(P(x), x) = 0$ for every $x$. Show that then, $Q(x, y) = (y - P(x))A(x, y)$ for some polynomial $A(x, y)$. This…
2
votes
4 answers

Find the values of a and k from the curve

The diagram below shows a curve with equation of the form ${y = kx(x + a)^2}$, which passes through the points (-2, 0), (0, 0) and (1, 3). What are the values of a and k. I know my roots are x = -2, x = 0 and x = 3. But as the y intercept is…
dagda1
  • 825
2
votes
1 answer

Name of operation on polynomials

Given 2 polynomials $p(x)=\prod_{i=1}^{r}(x-r_i), q(x)=\prod_{j=1}^{s}(x-r'_j)$, what is the name of the operation that constructs $f\#g(x) = \prod_{i=1}^{r}_{j=1}^{s} (x-r_i r'_j)$ from $p$ and $q$? Let's say $p, q \in \mathbb{Z}[x]$. Is there an…
Ofir
  • 6,245
2
votes
2 answers

To find constant term of polynomial defined recursively

Let $\{f_n(x)\}$ be a sequence of polynomials defined inductively as \begin{align*} f_1(x) &= (x-2)^2, \\ f_{n+1}(x) &= (f_n(x)-2)^2, \quad n \geq 1. \end{align*} Let $a_n$ and $b_n$ respectively denote the constant term and the…
Taylor Ted
  • 3,408
2
votes
3 answers

How find gcd polynomials?

How to find gcd of polynomials $gcd(x^3+x^2-x-1,3x^2+2x-1)$ ?? I divide of polynomials. It worked like this $\frac 13 x - \frac19$,$ R\left( x\right) =-\frac89x -\frac89$
piteer
  • 6,310
2
votes
6 answers

Relationship between the coefficients of a polynomial equation and its roots

My question is- Solve: $x^3 - 6x^2 + 3x + 10= 0$ given that the roots are in arithmetic progression. Any help would be greatly appreciated.
mgh
  • 1,005
  • 2
  • 10
  • 22
2
votes
1 answer

Lagrange interpolation uniqueness

How do I show that Lagrange's polynomial is the only one (with degree < n) that takes the given values at given points? ($f(x_{1})=y_{1}... \space f(x_{n})=y_{n}$)
Nesa
  • 1,255
2
votes
1 answer

What is the sum of all possible values of $\gamma$

The polynomial $x^3 +ax^2 +bx+c$ has three roots $\alpha ≤ \beta ≤ \gamma$, all of which are positive integers. Given that $2^2(a) + 2^1(b) + 2^0(c) = −2^{11}$ what is the sum of all possible values of $γ$? I tried using Vieta's and finding some…
Puzzled417
  • 6,956
2
votes
4 answers

Find the square root of the polynomial

My question is: Find the square root of the polynomial- $$\frac{x^2}{y^2} + \frac{y^2}{x^2} - 2\left(\frac{x}y + \frac{y}x\right) + 3$$
mgh
  • 1,005
  • 2
  • 10
  • 22
2
votes
2 answers

Why can't a polynomial fit infinitely many points of an exponential function?

Possible Duplicate: Polynomial satisfying $p(x)=3^{x}$ for $ x \in \mathbb{N}$ I'm looking for an elementary solution to this question: There is no polynomial $P$ such that $P(0)=1, P(1)=3, P(2)=9, P(3)=27, \dots$.
K1.
  • 976
2
votes
1 answer

How use Lagrange interpolation prove this inequality

How can I use Lagrange interpolation to solve the following problem? Let $a,b,c,d\in \mathbb{R}$ such that $$|ax^3+bx^2+cx+d|\le 1 $$ for every $x\in[-1,1]$. Show that $$|a|+|b|+|c|+|d|\le 7$$
user246688
2
votes
1 answer

Polynomial with integer coefficient evaluates to -1,1 in degree + 1 values

Does there exist a polynomial $P \in \mathbb{Z}[X]$ and pairwise distinct $a_1, \dots ,a_{d+1} \in \mathbb{Z}$, with $d > \deg(P)$, such that $|P(a_i)| = 1$ for all $i \in \{1, \dots, d+1\}$? I am pretty sure that such a polynomial cannot exist.…
Joachim
  • 2,623