Archive for February 2005

Greatest common divisor

View as: view on E2  view as PDF

Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.