MATH 3330 Computational Algebra: Midterm

Q1 - Q4: please solve/prove them by hands, not any program.

Q2: show each step as we did in class.
Q3: give explicit counterexamples.
Q5 needs your Maple proc in Assignment 2.

Dont discuss the exam with others. If one copied anothers work, both will
receive zero.

1. In K[x] (one variable), let < be a term order. Show that it must be the usual one,
that is, the one such that
1 < x < x2 < x3 <

2. Let f = x3 y 3 + 2y 2 , f1 = 2xy 2 + 3x + 4y 2 , f2 = y 2 2y 2 Q[x, y]. Using lex with

x > y, divide f by f1 , f2 to obtain a reminder r and u1 , u2 such that f = u1 f1 +u2 f2 +r.
Repeat this question reversing the role of f1 and f2 .

3. Let f, g, s, r K[x1 , . . . , xn ], n 2, and let F be a collection of non-zero polynomials

in K[x1 , . . . , xn ]. Disprove the following:
(i) If f F r and f F s, then f + g F r + s.
(ii) If f F r and f F s, then f g F rs.

4. Let f (x) = am xm + + a0 and g(x) = bn xn + + b0 . Show

(i) If g = qf + r, deg r = k, then Res(f, g) = Res(f, qf + r) = ank
m Res(f, r).
m(m1)
(ii) Res(f, f 0 ) = (1) 2 am Dis(f ).

5. Extend your GCD Maple proc in Assignment 2 to polynomial case, that is, write a
Maple proc to compute the gcd of two polynomials f (x) and g(x) in Q[x], and also
find two polynomials u1 , u2 satisfying u1 f + u2 g = gcd(f, g). Give an example to test
your proc.