arXiv · 0907.0361
Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm
Abstract
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
Explore related subjects
Keep this discovery
Jan Hilmar, Chris Smyth. 2009-07-02. Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm. https://arxiv.org/abs/0907.0361
Cite the original work for its findings. Save a collection to share your selection of sources.