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

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

2009-07-02

arxiv.org/abs/0907.0361v1

Mathematics

Algebraic Geometry

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730764