Since integer division reduces to repeated subtraction, Euclid's algorithm for finding the greatest common divisor may be recast in terms of subtraction. This is done, for example, in Trakhtenbrot,1 for automatic machine computation.
A general method for finding factors common to two polynomials is developed. The process is shown to have immediate application to the removal of multiplicities when attempting to root polynomials. Computational procedures and likely difficulties are discussed.
