Intersection of Two Curves
Summary: To find the intersections of two curves expressed by equations in the common coordinates , eliminate to obtain a polynomial in alone; its real roots give the abscissas of the intersections, and the corresponding ordinates are read off from either original equation. The same procedure underlies the line-curve intersection bound of line-curve-intersection-bound, but generalizes to two arbitrary algebraic curves.
Sources: chapter19 (§§457–464), figures94-98 (figures 94, 95).
Last updated: 2026-05-12.
The procedure (§§457–464)
Let two curves be given by
in the same rectangular coordinates with the same origin and axis. At an intersection point, the values of and satisfy both equations simultaneously.
- Eliminate : combine the two equations to produce a single equation containing only and known constants.
- Solve for : the real roots of are the abscissas of the candidate intersection points.
- Recover : substitute each root back into either original equation to obtain the corresponding ordinate .
When one curve is a straight line , the substitution into the equation of the curve is immediate and reduces to a single-valued function of . Every real root of the resulting polynomial then corresponds to a true intersection. This is the classical line-curve case (line-curve-intersection-bound).
For two genuine curves (figure 95), the elimination is more delicate: each curve can be a multi-valued function of , and the resulting equation in may admit roots whose corresponding ordinate values are complex — a phenomenon Euler isolates as the complex intersection (complex-intersections).
Why eliminate rather than just intersect ordinates (§461)
Once the abscissas are known, one could erect the ordinates and look for points where they meet either curve. But each ordinate can intersect a curve at several heights, so it is unclear which of those heights is the actual intersection. Eliminating instead delivers the ordinate value directly at each abscissa, without consulting either curve a second time.
When two of the roots coincide, the two intersection points and merge into one. This is either a tangency or a double point of the multi-point type — distinguished by whether the merged point is a smooth tangent contact or a transverse self-crossing.
Number of intersections (§§460, 462)
The substitution from a linear equation enters only to the first power, so the substituted polynomial has the same degree as the original curve equation in and (or lower if the leading -coefficient drops out under summation). Hence:
- The number of intersections of a curve of order with a straight line is at most , recovering line-curve-intersection-bound as a corollary.
- More generally, the number of real intersections of two curves is at most the degree of the eliminant in — a bound which, in modern terms, equals for curves of orders and (Bézout’s theorem). Euler hints at this in §457 but the explicit statement is deferred to chapter 20.
If the eliminant has no real roots, the curves do not meet and the straight line is not even tangent. If it has real roots whose corresponding ordinates are complex, there are complex intersections but no real ones — see complex-intersections.
Worked example: parabola vs. circle (§465)
Take the parabola and the circle . Subtracting,
so is a non-irrational (single-valued rational) function of . Substituting into the circle’s equation,
Each real root of this quartic in corresponds to a true intersection. With the quartic becomes , factoring as ; the root gives , i.e., an intersection on the axis.
Because here is a single-valued function of , this example escapes complex intersections entirely.
Figures
Figures 94–98