Scribd
Upload
42 views2 pages

Linear 11

Uploaded by

j90386544
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views2 pages

Linear 11

Uploaded by

j90386544
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER XI

Polynomials and Primary


Decomposition

XI, §1 The Euclidean Algorithm


1. In each of the following cases. write f = qg + r with deg r < deg g.
(a)f(t)=t 2 -2t+1. g(t)=t-1
(b) f(t)=t 3 +t-1. g(t)=t 2 +1
(c) f(t)=t 3 +t. g(t)=t
(d)f(t)=t 3 -1. g(t)=t-1

SOLUTION.
(a) f(t)=(t-1)g(t). (b) f(t) = tg(t)-1.

(c) f(t)=(t 2 +1)g(t). (d) f(t) = (t' + t + l)g(t).

2. If f( t) has integer coefficients. and if g( t) has integer coefficients and lead-


ing coefficient I. show that when we express f = qg + r with
deg r < deg g. the polynomials q and r also have integer coefficients.

SOLUTION. Use induction and proceed as in Theorem 1.1. By assumption.


bm = 1. so anb~1 is an integer; thus anb~ltn-m + ql and r have integer coef-
ficients.

3. Using the intermediate value theorem of calculus. show that every polyno-
mial of odd degree over the real numbers has a root in the real numbers.

SOLUTION. Suppose that p(t) = a/' +... +a". where an :;t: 0 and n is odd.
We may assume that an > 0 because a is a root for p if and only if a is a
root for - p. Then for t:;t: 0 we have

R. Shakarchi, Solutions Manual for Lang's Linear Algebra


© Springer-Verlag New York, Inc. 1996
ANSWERS TO EXERCISES 161

p(t)=aJ"(l+ a"_1
a.t
+. . +~J,
ant"

and so lim p(t) = 00 and lim p(t) = - 0 0 . The intermediate value theorem
l.....,."" t--)-oo

implies that p has a real root.

4. Let f(t) = t"+... +ao be a polynomial with complex coefficients, of degree


n, and let a be a root. Show that I a I:::; n· max, 1a, I. [Hint: Write
-a" = a"_la"-1 +... +ao' If Ia I> n· max, 1 a, I, divide by a" and take the ab-
solute value, together with a simple estimate to get a contradiction.]

SOLUTION. If Ia I:::; 1, there is no problem. Assume Ia I> 1; then we can


divide

by a" so that

Taking absolute values and using the triangle inequality and our assumption
that Ia I> 1, we get

I I> n· max,l a,l, then


If a

1 1
1 <-+... +-= 1,
n n

which is a contradiction.

XI, §2 Greatest Common Divisor


1. Show t" -1 that is divisible by t -1.

SOLUTION. t" -1 = (1+... +t"-1 )(t -1).

2. Show that t 4 + 4 can be factored as a product of polynomials of degree 2


with integer coefficients.

You might also like