Project 1 for CMSC 656  Symbolic & Algebraic Computation


Due:  Wednesday October 12, 1994



Part 1. Write Maple procedures that implement the extended Euclidean
	algorithm (algorithm 2.2, p36 of Heck) for:
	
		a) The integers  Z

		b) The ring Q[x] of univariate polynomials with
		   coefficients in the rationals  Q

Part 2.	Write Maple procedures that implement the primitive Euclidean
	algorithm (algorithm 2.3, p57 of Heck) for the ring Q[x] of 
	univariate polynomials with coefficients in the rationals  Q

In both Part 1 and 2, test your procedures with Maple's version of 
these algorithms.  How do they compare?