Problem of the Month
Problem 6: March 2024
This month’s problem is an introduction to some of the basic ideas
that come up when studying polynomials. It is presented with many
exercises interspersed among some definitions. Some of the exercises are
computational and some are theoretical.
Complex Numbers: The polynomial does not have any real roots.
Because of this, we "invent" a root, and it is traditionally called
for "imaginary". That is, we
declare that is a number such
that or . From a desire to do arithmetic
with numbers "like" , we declare
that a complex number is a number of the form where and are real numbers. For example, and are complex numbers. Remembering
that and using expected
arithmetic rules, we can add and multiply complex numbers. For example,
Using the quadratic formula, complex
numbers give roots to all real quadratics. For example, the quadratic
has a discriminant
of , and so it has
no real roots. However, if we accept that means "a number that squares
to ", we can infer that or could reasonably be considered as
. Indeed, using the
quadratic formula, we get If you are new to complex numbers, or you just
want to have some fun, you might want to check that and using the methods for adding
and multiplying complex numbers demonstrated above.
For the next three exercises, it will be useful to remember that if
is a root of a polynomial , then is a factor of .
Find all roots of the polynomial .
Find all roots of the polynomial .
Find all roots of the polynomial .
Definition: A polynomial is called a rational
polynomial if all of its coefficients are rational numbers. The set
of rational polynomials is denoted by .
Definition: Suppose has degree at least
. We say that is reducible in (or reducible over
) if there are
rational polynomials and , both of degree at least , such that . We say that is irreducible over if it is not reducible
over . In other words,
is irreducible over if it cannot be factored as a
product of rational polynomials of degree lower than that of .
Determine whether each given polynomial is reducible or
irreducible over .
Definition: A complex number is called algebraic if it
is a root of some non-constant rational polynomial. That is, is algebraic if there is a
polynomial of
degree at least such that . The degree of the
algebraic number is the
smallest positive integer such
that there is a rational polynomial of degree with . [The word "positive" is
important because every number is a root of the constant polynomial.]
Show that , , , and are all algebraic
numbers and find their degrees. It might be easier to find the degrees
after thinking about some of the later questions.
Suppose is an
algebraic number of degree . Prove
that there is a unique irreducible polynomial of degree with leading coefficient equal to such that .
Note: Numbers that are not algebraic are called
transcendental numbers. Two famous examples of transcendental
numbers are and .
Definition: If is a polynomial and is a root of , then is a repeated root of
if there is a polynomial such that . Note that might be a complex number, which
means could have complex
coefficients.
Let . Find
complex numbers
such that . In
other words, find all roots of .
Hint: Some of the roots are small integers and every root corresponds a
linear factor.
Given a polynomial of
degree , if we expand the
expression (here, is another variable), we can write
as
for unique polynomials .
For the polynomial from
part (g), determine the polynomials and described above and find all
roots of and .
Suppose that is a
polynomial and that is a root of
. Prove that is a repeated root of if and only if is a root of .
Prove that if and are irreducible rational polynomials
with a root in common, then there is a rational number such that .
Prove that an irreducible rational polynomial cannot have a
repeated root.
Note: The division algorithm for
polynomials might be useful in some of the later problems. It will
be explained briefly in the hint.