Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm

Jan Hilmar, Chris Smyth

We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.