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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.