Factoring a Polynomial. The Relation Between Coefficients and Roots
[40/40%]Determine and so that is divisible without remainder by .
Show that for integers , , and , the polynomial is divisible by .
Prove that is divisible by for , and by for .
The equation has the root . Find the remaining roots.
Prove that a double root of the equation satisfies the equation , if the polynomials and are relatively prime.
Prove that a root of multiplicity of the equation
is a root of multiplicity of the equation . Here , are relatively prime polynomials and is a homogeneous function having no repeated linear factors.
Prove that a polynomial remains positive for all real if and only if
where are certain complex numbers.
Prove the identity:
Prove the identity:
Prove the identity:
Prove the identity:
Prove the identity:
Prove the identity:
Prove the identity:
Prove the identity:
for odd or even respectively.
Prove the identity:
Prove the identity:
Prove the identity:
Factor the polynomial .
Factor the polynomial .
Factor the polynomial .
Evaluate the product , where are the roots of the polynomial ( real).
The roots of the polynomial are related by , . Prove the identity: .
The roots of a polynomial of degree are related by , . Prove that one of the roots of equals , and the rest are related pairwise by the formulas , .
The equation , where , has terms. Show that it cannot have roots of multiplicity higher than .
Is the polynomial
divisible by ?
Find the relation between the coefficients of the polynomial , if its roots satisfy the relation .
Find the relation between , , and for which the roots of the equation form a geometric progression.
For what and do the roots of the equation form an arithmetic progression, and what progression specifically?
For what , , () does the equation have a triple root?
The remainders upon dividing a polynomial by , , are , , . Find the remainder upon dividing by .
The roots of the polynomial are , , and . Find the second-degree polynomial for which , , , and prove that is divisible by .
Find a seventh-degree polynomial such that is divisible by , and is divisible by .
Find a polynomial of degree such that is divisible by , and by .
Find a polynomial of degree that, upon division by , gives remainders .
Prove the validity of Euler's identity
where , the numbers are distinct, and is any polynomial of degree not exceeding .
In the equality
both sides can be expanded in powers of if the numbers , , and are less than unity. By equating, on both sides, the coefficients of like powers of , prove the identity
Setting in the identity of the preceding problem, obtain, for the Chebyshev polynomial , the explicit expression
Taking into account the behavior of the polynomial on the interval , prove that any other polynomial with real coefficients cannot remain, in absolute value, everywhere less than — that is, that the Chebyshev polynomial deviates least from zero on the interval .
, where and are relatively prime polynomials with no repeated roots. Setting , , where and are relatively prime, prove that is the greatest common divisor of the polynomials and .
The result is due to M. V. Ostrogradsky.