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
1
vote
1 answer

A problem on roots of polynomials

Problem: let $p(x) = x^n + a_1.x^{n-1} + a_2.x^{n-2} +......+ a_n$ where $a_i \in \mathbb R$. If $a_1 ^2 \lt a_2$, prove that not all roots of $p(x)$ can be real. My attempt: I noticed that for $n = 2$ the claim is obviously true as the discriminant…
Lelouch
  • 724
1
vote
3 answers

What is the number of real roots of $x^6-3x^2+1=0$

What is the number of real roots of $$x^6-3x^2+1=0$$ ? I know that there are $6$ roots for this polynomial as the highest power is $6$ but how we could determine number of real roots or complex roots or repeated roots ? Thank you for your help…
user373141
  • 2,503
1
vote
0 answers

finding roots and factors of a polynomial

I want to factor $Y^5-5Y+12$ in $\mathbb Q[X]/(X^5-5X+12)$. Obviously $Y-X$ is a factor. Is there any good way to find the others? Or just a quick way to find all roots would be great aswell (in general). So I want to factor $Y^4 + X*Y^3 + X^2*Y^2 +…
owo
  • 31
1
vote
2 answers

Make an uncountable dimension vector space out of polynomials?

We know that the set of all polynomials $a + bx + cx^2 +...$ forms a countably infinite dimension vector space. However, what if we want to form a vector space out of $f(x)=\sum_\alpha c_\alpha x^\alpha$, with $\alpha \in \mathbb R$. It would be…
user56834
  • 12,925
1
vote
2 answers

Polynomial division.

If an f(x) is divided by x²+4, has 2x+3 of remainder. If an f(x) is divided by x²+6, has 6x-1 of remainder. If an f(x) is divided by (x²+4)(x²+6), has S(x) of remainder, then find S(4)! I have this. I wrote it in polynomial…
1
vote
1 answer

Complex analysis question regarding polynomial and maximum modulus principle

If I have a polynomial of the form $p(z) = a_0 + a_1z + \cdots + a_nz^n$ with complex coefficients, how can I show that each coefficient is bounded.
1
vote
1 answer

Divison of same degree polynomials Mod 3 - Euclidean Algorithm

I have a question that I am looking for some help on. I have two polynomials $f(x)$ and $g(x)$ and I am looking to find the $gcd(f(x),g(x))$ where the coefficients are reduced in modulo 3. In my case, $f(x)$ and $g(x)$ both are degree 4. I have the…
ptsgeeg
  • 73
1
vote
3 answers

No. of real roots of $(x − a)^{2n+1} + (x − b)^{2n+1} = 0$

Let n be a positive integer and $0 < a < b < 1$. The total number of real roots of the equation $(x − a)^{2n+1} + (x − b)^{2n+1} = 0$ is? Taking the derivative $f'(x)>0$ Therefore it will cross x axis only once , so it has only one root. Is…
user405925
  • 343
  • 3
  • 13
1
vote
1 answer

Solve the equations.

Solve for real numbers $x$ & $y$ : $$xy^2=15x^2+17xy+15y^2$$ $$x^2y=20x^2+3y^2$$. It is my problem. Please help me
1
vote
1 answer

Polynomial division in 3 variables

I'm trying to compute $$\frac{x^3-2x^2-xyz+2xy+yz}{x-2}$$ I have written this in the form $$\begin{align}x^3-2x^2-xyz+2xy+yz&=(x-2)(x^2+bx+cy+dz)\\ x^3-2x^2-(yz+2y)x+yz&= x^3 + (b-2)x^2 + (cy+dz-2b)x+(-2cy-2dz) \end{align}$$ This leaves me with the…
lioness99a
  • 4,943
1
vote
4 answers

Vieta's Formula - Hard Problem

Let $f(x)=(x^2+6x+9)^{50}-4x+3$, and let $r_1,r_2,\ldots,r_{100}$ be the roots of >$f(x)$. Compute $(r_1+3)^{100}+(r_2+3)^{100}+\cdots+(r_{100}+3)^{100}$. How would I compute this? How to factor it?
JenkinsMa
  • 415
1
vote
1 answer

Equality of polynomials

We know that $a_nx^n + a_{n-1}x^{n-1} + \dots + a_0 = b_nx^n + b_{n-1}x^{n-1} + \dots + b_0 $. How we can prove that $a_n = b_n , a_{n-1} = b_{n-1} , \dots ,a_0 = b_0$ . Also if in right side instead of $x$ we put $z$ is this statement true ? $a_n =…
S.H.W
  • 4,379
1
vote
2 answers

Pseudo-code for Polynomial Long Division

I'm busy writing a polynomial long division class in Java, and I see that Wikipedia provides a great example for performing the long division by hand. However, when I compare it to the provided pseudo-code a few lines further on, something doesn't…
1
vote
1 answer

Show that there exist a polynomial $q_n(x) \in \mathbb Q[x] $ satisfying $p_n(x)=(x-1)^2q_n(x)$.

I have this problem, Let $$p_n(x)=nx^{n+1}-(n+1)x^n+1 \in \mathbb Q[x]$$ for any positive integer $n$. Show that there exist a polynomial $q_n(x) \in \mathbb Q[x] $ satisfying $p_n(x)=(x-1)^2q_n(x)$. initially I thought that I could use the division…
somethin'
  • 227
  • 1
  • 5
1
vote
1 answer

Sum of tensor-product of polynomials

Suppose you've got two degrees of freedom $x$ and $y$ and a function of the form \begin{align} F(x,y) = p_1(x) p_2(y) + p_3(x) p_4(y) + \ldots + p_n(x) p_{n+1}(y), \end{align} where the $p_i$ are polynomials (of arbitrary degree). My question is:…