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

How to easily create a polynomial function that gives a desired output?

I am looking for an easy way (formula or algorithm) to create a polynomial function that gives the arbitrary preset output for the first values of x. For instance, the desired output can be $y = 1, 2, 3, 4, 5, 6, 100$ for $x = 1, 2, 3, 4, 5, 6, 7$.…
user596191
6
votes
4 answers

Find the roots of $3x^3-4x-8$

It is given that $\alpha$, $\beta$ and $\gamma$ are the roots of the polynomial $3x^3-4x-8$. I have been asked to calculate the value of $\alpha^2 + \beta^2 + \gamma^2$. However I am unsure how to find these roots, seeing as though I haven't been…
Emily
  • 81
6
votes
4 answers

Solve $\frac{1}{(x+1)(x+2)}+\frac{1}{(x+2)(x+3)}+\frac{1}{(x+3)(x+4)}+\frac{1}{(x+4)(x+5)}=0.8$

Solve: $$\frac{1}{(x+1)(x+2)}+\frac{1}{(x+2)(x+3)}+\frac{1}{(x+3)(x+4)}+\frac{1}{(x+4)(x+5)}=0.8$$ This is taken from one of the TAU entry tests (I have one in 2 weeks :) ) So, I don't really recognize anything speical here except that there's some…
user565804
6
votes
1 answer

If $f\in \mathbb{Z[x]}$ is a polynomial and $f(2^n)$ is a perfect square for all $n$, then there is a $g\in \mathbb{Z[x]}$ such that $f=g^2$

If $f\in \mathbb{Z[x]}$ is a polynomial and $f(2^n)$ is a perfect square for all $n$, then there is a $g\in \mathbb{Z[x]}$ such that $f=g^2$ I understand that there might be an issue with the problem statement but I don't know anything…
Mathejunior
  • 3,344
6
votes
0 answers

Check my proof of the polynomial uniqueness

Problem 169 from the book I.M. Gelfand, "Algebra". "Assume that $x_1, \ldots , x_{10}$ are different numbers, and $y_1 , \ldots , y_{10}$ are arbitrary numbers. Prove that there is one and only one polynomial $P(x)$ of degree not exceeding $9$ such…
mosceo
  • 2,035
6
votes
2 answers

Polynomials such that they are integer valued except for some integer k?

Let $k>0$ be an integer, Do there exist polynomials with rational coefficients such that a) for each positive integer input not equal to $k$ we output an integer, and b) for input $k$ we do not output an integer? I am guessing that this is…
6
votes
1 answer

Help proving that a polynomial has n roots and that they're all different

Given the nature of the exercise, I think the point is not using the Fundamental Theorem of Algebra to show there must be $n$ roots. Anyway, the polynomial is the following: $$x^n + x + 1$$ So far I've tried to reach an absurd by proposing a root…
6
votes
3 answers

If $P(a)=0 \Rightarrow P(a+1)=1$ then $P(x)$ has no repeated roots.

Let $P(x) \in \mathbb{R}[x]$ be polynomial with all real roots and has the property that $P(a)=0 \Rightarrow P(a+1)=1$ for all $a \in \mathbb{R}$. Prove that $P(x)$ has a repeated root. I think this problem statement is not true because if we…
user403160
  • 3,286
6
votes
1 answer

Calculate sum of roots

Consider the polynomial $P(x) = (x^2 + x + 1)^{2015} + x + 1$ with the roots $x_k, \: 1 \le k \le 4030$. Evaluate $$\sum _{k = 1}^{4030} \frac{1}{x_k}$$ I have found that $P(i) = 1$ and the remainder of $P / (x^2 + 1)$ is also $1$. I think the sum…
Liviu
  • 1,886
  • 1
  • 10
  • 17
6
votes
2 answers

Minimal $n$ for a polynomial to divide $x^n-1$

Say I have a given polynomial $g(x)$ over the field $\mathbb Z_2 $. How can I find the minimal $n$ for which $g(x)|x^n-1$? For example, I was told that for any $n<32768$, $g(x)=x^{15}+x^{14}+1$ does not divide $x^n-1$ (I have spotted that…
SivanBH
  • 195
6
votes
2 answers

What if a polynomial is identically zero?

From Barbeau's Polynomials: (a) Is it possible to find a polynomial, apart from the constant $0$ itself, which is identically equal to $0$ (i.e. a polynomial $P(t)$ with some nonzero coefficient such that $P(c)=0$ for each number $c$)? And…
Red Banana
  • 23,956
  • 20
  • 91
  • 192
6
votes
1 answer

What are the coefficients of $(x+1)(x+2)\dotsb(x+n)$?

Let $(x+1)(x+2)\dotsb(x+n)=c(0,n)x^n+c(1,n)x^{n-1}+c(2,n)x^{n-2}\dotsb+c(n,n)$ By multiplying both sides by $(x+n+1)$ we obtain $c(k,n)=c(k,n-1)+nc(k-1,n-1)$ and it is clear that $c(n,n)=n!$ so $$c(k,n)-c(k,n-1)=nc(k-1,n-1)\implies\sum_{h=k+1}^n…
Sophie
  • 3,378
6
votes
3 answers

Prove or disprove that $\sqrt[3]{2}+\sqrt{1+\sqrt2}$ is a root of a polynomial

Prove or disprove that there is a polynomial with integer coefficients such that the number $\sqrt[3]{2}+\sqrt{1+\sqrt2}$ is a root. My work so far: Let $P(x)=x^3-2$. Then $\sqrt[3]{2}$ is a root of $P(x)$ Let $Q(x)=x^4-2x^2-1$. Then…
Roman83
  • 17,884
  • 3
  • 26
  • 70
6
votes
4 answers

Why D≥0 while finding the range of rational functions

To find the range of a rational expression $f(x)=y$, a) We first make a quadratic in $x$ in terms of $y$. b) Make the discriminant $\Delta ≥ 0$ c) Solve the resulting inequality to get the range of $y$. I am having trouble in the second step. I…
bluebellae
  • 1,623
6
votes
1 answer

Why is this polynomial irreducible

Let $n \in \mathbb{N}_+$ and $a \in \mathbb{Q}$. Prove that the polynomial $$P(x) = x^{2^n}\left(x+a\right)^{2^n} + 1 \in \mathbb{Q}[x]$$ is irreducible. I don't really have an idea what to do with it. For $n=1$ I could use brute-force approach,…