Electronic Proceedings of the Sixteenth Annual International Conference on Technology in Collegiate MathematicsChicago, Illinois, October 30November 2, 2003Paper S047
This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Sixteenth Annual International Conference on Technology in Collegiate Mathematics, Edited by Corinna Mansfield, ISBN 032130456x, Copyright (C) 2005 by AddisonWesley Publishing Company, Inc. 
Exploring Euclid's Algorithm for Fun and Profit 
Click to access this paper:

Euclid's algorithm for greatest common divisor is perhaps the oldest nontrivial algorithm still in use. Polynomial GCD computation is at the heart of every computer algebra system. We consider how the Euclidean algorithm for polynomials can be implemented efficiently and present some surprising applications to polynomial factorization, simplification of expressions involving radicals, and rational function integration.
Keyword(s): number theory, computer algebra systems, calculus