Based on the Bezout approach we propose a simple algorithm to determine gcd of two polynomials which doesn’t need division, like Euclidean algorithm, or determinant calculations, Sylvester matrix algorithm. The needs only n steps for degree n. Formal manipulations give discriminant resultant any without needing division nor calculation.
