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
5
votes
4 answers

Prove that the 3 roots are rational.

Let $ f $ be a polynomial of degree $ 3 $ and having rational coefficients. Prove that, if there exist two distinct nonzero rational numbers $ a,b $ and two roots $ x_1,y_1 $ of $ f $ such that $ ax_1+by_1 $ is rational, then all roots of $ f $ are…
zaemon_23
  • 465
5
votes
2 answers

Find the coefficient of $x^6$ in the expansion of ($1-2x+3x^2-4x^3+5x^4) ^4$.

Find the coefficient of $x^6$ in the expansion of $(1-2x+3x^2-4x^3+5x^4)^4$. My attempt: Consider $(1-y)^{-2}=1+2y+3y^2+4y^3+\dots$ Then I substitute $y=-x$, get $(1+x)^{-2}= 1-2x+3x^2-4x^3+\dots$ The original polynomial can be written as…
5
votes
1 answer

prove $f(x)$ has no integral roots.

Suppose $f(x)$ is a polynomial with integral coefficients. Prove: If there exists an even number $a$ and an odd number $b$ such that $f(a)$ and $f(b)$ are odd numbers, then $f(x)$ has no integral roots. my proof: Suppose $p$ is an integral root,…
forlorn
  • 309
5
votes
2 answers

Proving f(gh) = (fg)h

I am trying to prove that $f(gh)=(fg)h$ for $f,g,h \in R[\mathbb{N}^n]$. Context to the exercise: We define the polynomial ring $R[X_1,...,X_n]$ in $n$ variables as $$ R=[X_1,...,X_n] = R[\mathbb{N}^n] = \\\{ f:\mathbb{N}^n \to R | f(v)=0,|v| >> 0…
MNS1517
  • 63
5
votes
1 answer

Descartes rule of sign with positive real exponents

While Descartes' rule of sign works for polynomials, does it work for 'polynomials' where the exponents are real instead of natural? That is does it work for $$5x^{\alpha} -2x^{\beta} + 3x^{\gamma} + 3 =0$$ where, assuming I have ordered them such…
danny dan
  • 63
  • 2
5
votes
2 answers

If the square of a rational polynomial has integer coefficients does it have integer coefficients as well?

Given a polynomial $f \in \mathbb{Q}[x]$ such that $f^2 \in \mathbb{Z}[x]$, is $f \in \mathbb{Z}[x]$? In words, if the square of a rational polynomial has integer coefficients does it have integer coefficients as well? I doubt this is true, but it…
user323867
5
votes
3 answers

Constructing a polynomial with integer coefficient's sharing roots with another two polynomials

Let $i$ be a root of the equation $ x ^2 + 1 = 0 $and let $ω$ be a root of the equation $x^2 + x + 1 = 0$. Construct a polynomial $f(x) = \sum_k a_k x^k$ with $a_k \in \mathbb{Z}$ such that $f(i+w)=0$. Source After some long thought, I got a…
5
votes
1 answer

Find the magnitude of the product of all complex numbers $c$ such $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$

Find the magnitude of the product of all complex numbers $c$ such that the recurrence defined by $x_1 = 1$, $x_2 = c^2 - 4c + 7$, and $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$ also satisfies $x_{1006} = 2011$. My try: Lemma 1: $x_n$ is a…
math110
  • 93,304
5
votes
3 answers

Can we use infinite series to multiply finite polynomial series?

I was trying to figure out the expansion of the product: $$Q= (1+x)(1+x^2)(1+x^4)..(1+x^{2^n})$$ Multiplying and dividing by $1-x$ $$ Q = \frac{1}{1-x} [ 1-x^{2^{n+1}}]$$ Expanding the denominator as geometric series: $$ Q = - [ x^{2^{n+1}} - 1 ]…
5
votes
2 answers

Polynomial and distinct roots

Find all real m such that $x^3-2x^2-2x+m$ has 3 distinct rational roots. Source: School exam paper. No idea why it seems so hard I don't think rational root theorem works, since m is not necessarily integer (clearly it is rational though) Assuming…
61plus
  • 353
5
votes
5 answers

Question on Cardano's Method of Solving Cubic Polynomial Equations

I'm having trouble with part of a question on Cardano's method for solving cubic polynomial equations. This is a multi-part question, and I have been able to answer most of it. But I am having trouble with the last part. I think I'll just post here…
scipio
  • 595
5
votes
2 answers

Bunyakovsky conjecture

The Bunyakovsky conjecture states the following : Let $f$ be an irreducible polynomial and $d$ denote the gcd of the set $f(a)$, where $a$ runs over the integers. Then, $f(a)/d$ is prime for infinite many integers $a$. I found statements…
Peter
  • 51
5
votes
1 answer

A family of polynomials whose roots all have moduli 1

Let $k$ be a natural number. Let $$f_k(x)=(k+1)x(x^{2k}-1)+k(x^{2k+2}-1)=0.$$ Using Mathematica, I find that, when $k\le 13$, all of the roots of $f_k(x)$ have moduli 1. Does this hold for all $k$? If YES, how to prove it? Thanks to everyone!
oldsea
  • 103
5
votes
1 answer

Does the polynomial $P(x)$ have integer zeros?

The following is a homework question: Let $P(x)$ be a polynomial with integer coefficients and $P(x_1)=P(x_2)=P(x_3)=P(x_4)=P(x_5)=P(x_6)=P(x_7)=7$ where $x_i$ are distinct integers. Determine if $P(x)$ has integer zeros. I've never done questions…
Angie
  • 93
  • 4
5
votes
4 answers

Integer polynomial and division by binomial

If I have an integer coefficient polynomial $f(x)$ and know that it has 2 integer roots, $x_1$ and $x_2$, is it true that $$f(x) = (x-x_1)(x-x_2) h(x)$$ where $h(x)$ is another integer coefficient polynomial? What is this result called if it is…
John
  • 375