Group Theory and Linear Algebra
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last updated: 20 September 2014
Lecture 6: Greatest common divisors and Euclid's algorithm
Number systems – polynomials
Let be a field.
with addition and product so that
for example.
Let The ideal generated by ,
or the set of multiples of , is
For example,
Let
The polynomial divides ,
if
Let
The greatest common divisor of and
is a monic polynomial such that
(a) |
and
|
(b) |
If and
and then
|
Let
with The degree of is
such that
and if
and then
A polynomial
is monic if where
(Euclid's algorithm) Let
There exist
such that
(a) |
|
(b) |
Either or
|
Let
(a) |
There exists a monic polynomial such that
|
(b) |
Let Then
|
Find
So
So
and
Notes and References
These are a typed copy of Lecture 6 from a series of handwritten lecture notes for the class Group Theory and Linear Algebra given on August 5, 2011.
page history